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 19:42Josu San MartinJosu San MartinScore: 4,640Success
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 19:424,62146,789,78437,332,0001,030,0002,113,536
2Aug 30, 2026 19:424,62546,807,78237,367,0001,025,0002,113,536
3Aug 30, 2026 19:424,63446,922,22837,334,0001,134,0002,113,536
4Aug 30, 2026 19:424,63446,885,21337,405,0001,062,0002,113,536
5Aug 30, 2026 19:424,64046,983,91537,390,0001,130,0002,113,536
6Aug 30, 2026 19:424,64546,991,98737,497,0001,059,0002,113,536
7Aug 30, 2026 19:424,64947,097,59337,461,0001,127,0002,113,536
8Aug 30, 2026 19:424,65847,144,10937,534,0001,135,0002,113,536
9Aug 30, 2026 19:424,68647,354,49137,780,0001,120,0002,113,536