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 listAug 28, 2026 15:55Victor MerckléVictor MerckléScore: 6,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:556,83765,167,36655,652,0001,098,0002,113,536
2Aug 28, 2026 15:556,85865,319,23755,792,0001,130,0002,113,536
3Aug 28, 2026 15:556,86565,351,44155,870,0001,115,0002,113,536
4Aug 28, 2026 15:556,87366,691,55155,951,0001,097,0002,113,536
5Aug 28, 2026 15:556,87465,396,34155,942,0001,120,0002,113,536
6Aug 28, 2026 15:556,87665,445,76155,960,0001,116,0002,113,536
7Aug 28, 2026 15:556,88665,599,42356,021,0001,134,0002,113,536
8Aug 28, 2026 15:556,88865,542,34056,135,0001,036,0002,113,536
9Aug 28, 2026 15:556,92565,857,79656,451,0001,031,0002,113,536