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 12, 2026 04:25Josu San MartinJosu San MartinScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 04:263,87040,650,22031,041,0001,086,0002,113,536
2May 12, 2026 04:263,87441,832,56431,080,0001,075,0002,113,536
3May 12, 2026 04:263,87941,834,80131,059,0001,140,0002,113,536
4May 12, 2026 04:263,88042,346,06131,099,0001,105,0002,113,536
5May 12, 2026 04:263,88240,644,33431,149,0001,072,0002,113,536
6May 12, 2026 04:263,88341,820,97131,140,0001,095,0002,113,536
7May 12, 2026 04:263,89441,506,29431,247,0001,081,0002,113,536
8May 12, 2026 04:263,90239,986,93131,312,0001,082,0002,113,536
9May 12, 2026 04:263,91441,534,97031,405,0001,082,0002,113,536