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 25, 2026 18:36ritesh-25ritesh-25Score: 2,075,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 18:362,065,50717,174,660,11517,068,746,00074,963,0002,519,040
2Mar 25, 2026 18:362,069,52317,205,436,70117,107,068,00069,971,0002,281,472
3Mar 25, 2026 18:362,072,56117,236,879,35217,136,296,00065,962,0002,281,472
4Mar 25, 2026 18:362,072,71417,248,102,54517,127,563,00075,967,0002,281,472
5Mar 25, 2026 18:362,075,71917,262,052,22917,145,528,00082,939,0002,293,760
6Mar 25, 2026 18:362,076,66317,286,216,94017,153,366,00082,938,0002,281,472
7Mar 25, 2026 18:362,108,23617,535,958,23417,424,402,00073,955,0002,281,472
8Mar 25, 2026 18:362,116,90417,604,711,16617,496,347,00073,954,0002,293,760
9Mar 25, 2026 18:362,169,52518,048,222,19517,916,144,00090,914,0002,273,280