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 20, 2026 18:57Victor MerckléVictor MerckléScore: 4,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:584,78047,467,21638,606,0001,068,0002,117,632stderr
2May 20, 2026 18:584,78248,110,14638,691,0001,005,0002,117,632stderr
3May 20, 2026 18:584,78350,513,13138,702,0001,004,0002,117,632stderr
4May 20, 2026 18:584,78347,830,09638,696,0001,005,0002,117,632stderr
5May 20, 2026 18:584,79347,588,99938,751,0001,039,0002,117,632stderr
6May 20, 2026 18:584,79847,541,70938,817,0001,007,0002,117,632stderr
7May 20, 2026 18:584,79948,169,48338,829,0001,004,0002,117,632stderr
8May 20, 2026 18:584,83350,154,53639,093,0001,024,0002,117,632stderr
9May 20, 2026 18:584,87351,078,92739,440,0001,011,0002,117,632stderr