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 20, 2026 05:43M-RochatM-RochatScore: 12,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4312,447113,723,434100,991,0002,321,0002,113,536
2May 20, 2026 05:4312,450115,518,254101,327,0002,009,0002,113,536
3May 20, 2026 05:4312,478114,883,539101,232,0002,340,0002,113,536
4May 20, 2026 05:4312,484115,755,424101,293,0002,325,0002,113,536
5May 20, 2026 05:4312,487115,279,052101,577,0002,069,0002,113,536
6May 20, 2026 05:4312,487115,875,760101,594,0002,050,0002,113,536
7May 20, 2026 05:4312,515116,033,268101,534,0002,347,0002,113,536
8May 20, 2026 05:4312,575116,251,523102,305,0002,068,0002,113,536
9May 20, 2026 05:4312,700129,130,113103,352,0002,058,0002,113,536