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 10, 2026 07:57Josu San MartinJosu San MartinScore: 4,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 07:574,14751,653,80833,302,0001,121,0002,486,272
2May 10, 2026 07:574,14950,146,96133,331,0001,109,0002,486,272
3May 10, 2026 07:574,15050,050,76933,325,0001,128,0002,482,176
4May 10, 2026 07:574,15849,671,29733,391,0001,127,0002,490,368
5May 10, 2026 07:574,16250,243,61033,399,0001,148,0002,482,176
6May 10, 2026 07:574,17651,334,28733,535,0001,131,0002,478,080
7May 10, 2026 07:574,18551,029,56233,697,0001,045,0002,486,272
8May 10, 2026 07:574,23250,725,83433,984,0001,146,0002,490,368
9May 10, 2026 07:574,24551,677,25434,204,0001,031,0002,482,176