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 listSep 29, 2026 07:26Karthik ReddyKarthik ReddyScore: 6,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 07:266,13161,339,50049,692,0001,197,0002,113,536
2Sep 29, 2026 07:266,14761,518,43649,829,0001,192,0002,113,536
3Sep 29, 2026 07:266,14961,579,57349,839,0001,198,0002,113,536
4Sep 29, 2026 07:266,14961,606,62450,027,0001,017,0002,113,536
5Sep 29, 2026 07:266,15861,587,32749,919,0001,196,0002,113,536
6Sep 29, 2026 07:266,16061,650,40649,947,0001,186,0002,113,536
7Sep 29, 2026 07:266,16761,702,74749,993,0001,194,0002,113,536
8Sep 29, 2026 07:266,20362,074,59250,470,0001,021,0002,113,536
9Sep 29, 2026 07:266,20362,028,01950,304,0001,185,0002,113,536