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 listFeb 19, 2026 01:35Josu San MartinJosu San MartinScore: 6,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 01:356,04878,187,20849,197,0001,004,0002,277,376
2Feb 19, 2026 01:356,05872,605,25849,278,0001,005,0002,392,064
3Feb 19, 2026 01:356,15173,116,87949,049,0002,002,0002,281,472
4Feb 19, 2026 01:356,21275,786,71750,552,0001,011,0002,400,256
5Feb 19, 2026 01:356,24177,627,36350,805,000996,0002,514,944
6Feb 19, 2026 01:356,24777,166,24549,856,0001,994,0002,281,472