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 listMay 23, 2026 22:33Maya RebholzMaya RebholzScore: 8,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:348,21480,062,37562,852,0005,329,0002,117,632
2May 23, 2026 22:348,27078,090,81763,214,0005,430,0002,117,632
3May 23, 2026 22:348,28978,153,04063,601,0005,198,0002,113,536
4May 23, 2026 22:348,29181,783,66563,311,0005,511,0002,117,632
5May 23, 2026 22:348,31080,826,84463,344,0005,637,0002,117,632
6May 23, 2026 22:348,33178,992,52963,506,0005,642,0002,113,536
7May 23, 2026 22:348,33580,992,25763,396,0005,788,0002,117,632
8May 23, 2026 22:348,38482,107,24963,955,0005,639,0002,113,536
9May 23, 2026 22:348,41781,256,99364,061,0005,808,0002,117,632