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 04:21Victor MerckléVictor MerckléScore: 7,277Success
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 04:217,25767,533,79260,241,00002,113,536
2May 14, 2026 04:217,25870,253,33960,244,00002,113,536
3May 14, 2026 04:217,25967,954,31860,250,00002,113,536
4May 14, 2026 04:217,26467,632,57359,269,0001,030,0002,113,536
5May 14, 2026 04:217,27767,664,04459,395,0001,012,0002,113,536
6May 14, 2026 04:217,28567,797,80959,424,0001,048,0002,113,536
7May 14, 2026 04:217,31668,115,55960,724,00002,113,536
8May 14, 2026 04:217,32068,616,36060,763,00002,113,536
9May 14, 2026 04:217,44470,875,38161,790,00002,113,536