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 14, 2026 06:39Victor MerckléVictor MerckléScore: 6,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:396,96467,935,20656,766,0001,037,0002,113,536
2May 14, 2026 06:396,96668,252,19356,816,0001,002,0002,113,536
3May 14, 2026 06:396,96767,246,23856,830,0001,002,0002,113,536
4May 14, 2026 06:396,96867,313,18757,835,00002,113,536
5May 14, 2026 06:396,96965,177,44157,848,00002,113,536
6May 14, 2026 06:396,96967,021,08057,846,00002,113,536
7May 14, 2026 06:396,97066,895,23557,851,00002,113,536
8May 14, 2026 06:396,97165,175,84257,866,00002,113,536
9May 14, 2026 06:396,97567,416,28857,898,00002,113,536