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 30, 2026 20:08Josu San MartinJosu San MartinScore: 4,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:084,42045,122,79635,662,0001,025,0002,113,536
2Aug 30, 2026 20:084,42445,166,77835,696,0001,027,0002,113,536
3Aug 30, 2026 20:084,42645,168,99135,713,0001,025,0002,113,536
4Aug 30, 2026 20:084,43945,341,40335,818,0001,026,0002,113,536
5Aug 30, 2026 20:084,44145,280,49335,840,0001,023,0002,113,536
6Aug 30, 2026 20:084,44645,347,24935,876,0001,026,0002,113,536
7Aug 30, 2026 20:084,45345,421,11735,937,0001,028,0002,113,536
8Aug 30, 2026 20:084,55046,304,40936,744,0001,026,0002,113,536
9Aug 30, 2026 20:084,57546,462,67336,947,0001,027,0002,113,536