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 20:52wnwnScore: 5,077Success
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 20:525,05067,333,91039,918,0001,995,0002,494,464
2Feb 19, 2026 20:525,05763,071,10139,974,0001,998,0002,494,464
3Feb 19, 2026 20:525,05963,100,79739,987,0001,999,0002,277,376
4Feb 19, 2026 20:525,05968,066,77839,991,0001,999,0002,494,464
5Feb 19, 2026 20:525,07763,372,35840,130,0002,006,0002,277,376
6Feb 19, 2026 20:525,08966,304,90740,224,0002,011,0002,494,464
7Feb 19, 2026 20:525,10366,655,10340,337,0002,016,0002,486,272
8Feb 19, 2026 20:525,13166,261,92941,577,0001,014,0002,494,464
9Feb 19, 2026 20:525,15665,801,14241,796,000995,0002,502,656