Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 23, 2026 02:19Alyssa VerkadeAlyssa VerkadeScore: 391,412Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 02:19389,2973,261,510,6013,177,192,00053,969,0002,289,664
2Mar 23, 2026 02:19390,0463,261,900,8693,165,417,00071,964,0002,289,664
3Mar 23, 2026 02:19390,0983,269,025,7153,164,844,00072,973,0002,281,472
4Mar 23, 2026 02:19391,0103,270,212,7023,166,425,00078,960,0002,359,296
5Mar 23, 2026 02:19391,4123,273,169,8843,182,743,00065,973,0002,281,472
6Mar 23, 2026 02:19392,3493,281,392,8963,170,538,00085,960,0002,359,296
7Mar 23, 2026 02:19392,6993,286,754,1293,186,461,00072,941,0002,281,472
8Mar 23, 2026 02:19393,8263,297,954,9533,194,787,00073,971,0002,289,664
9Mar 23, 2026 02:19402,6133,373,599,7033,264,715,00076,969,0002,351,104