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 listAug 4, 2026 08:38Teow Hua JunTeow Hua JunScore: 8,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:388,30080,022,22767,714,0001,184,0002,113,536
2Aug 4, 2026 08:388,30178,717,78167,726,0001,176,0002,113,536
3Aug 4, 2026 08:388,30778,790,40467,684,0001,269,0002,113,536
4Aug 4, 2026 08:388,31278,806,71367,980,0001,010,0002,113,536
5Aug 4, 2026 08:388,31378,825,53467,736,0001,268,0002,113,536
6Aug 4, 2026 08:388,32879,004,95167,844,0001,283,0002,113,536
7Aug 4, 2026 08:388,34579,083,09168,259,0001,010,0002,113,536
8Aug 4, 2026 08:388,35679,186,53968,087,0001,273,0002,113,536
9Aug 4, 2026 08:388,35779,241,09168,356,0001,009,0002,113,536