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 16, 2026 04:39Victor MerckléVictor MerckléScore: 6,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:446,94666,423,00756,655,0001,003,0002,113,536
2May 16, 2026 04:446,94965,058,28857,682,00002,113,536
3May 16, 2026 04:446,95067,855,76057,685,00002,113,536
4May 16, 2026 04:446,95067,091,09456,669,0001,020,0002,113,536
5May 16, 2026 04:446,95065,324,58056,692,0001,001,0002,113,536
6May 16, 2026 04:446,95366,714,00156,671,0001,046,0002,113,536
7May 16, 2026 04:446,96066,275,79956,690,0001,085,0002,113,536
8May 16, 2026 04:447,00666,334,77757,141,0001,010,0002,113,536
9May 16, 2026 04:447,01067,545,50258,189,00002,113,536