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 18:41Josu San MartinJosu San MartinScore: 4,631Success
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 18:414,61346,781,25037,168,0001,120,0002,113,536
2Aug 30, 2026 18:414,62446,902,37437,252,0001,134,0002,113,536
3Aug 30, 2026 18:414,62446,927,20837,345,0001,036,0002,113,536
4Aug 30, 2026 18:414,62946,850,52637,296,0001,126,0002,113,536
5Aug 30, 2026 18:414,63147,039,50437,329,0001,116,0002,113,536
6Aug 30, 2026 18:414,63547,084,66137,333,0001,142,0002,113,536
7Aug 30, 2026 18:414,63846,953,95637,376,0001,124,0002,113,536
8Aug 30, 2026 18:414,64147,701,96437,493,0001,034,0002,113,536
9Aug 30, 2026 18:414,64547,352,50737,437,0001,117,0002,113,536