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 listMar 18, 2026 16:20Josu San MartinJosu San MartinScore: 6,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 16:205,79870,946,63245,116,0003,007,0002,400,256
2Mar 18, 2026 16:206,02172,682,31047,975,0001,998,0002,277,376
3Mar 18, 2026 16:206,19776,637,25549,418,0002,017,0002,408,448