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 13, 2026 16:32Victor MerckléVictor MerckléScore: 8,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 16:328,06374,207,12765,916,0001,011,0002,113,536
2May 13, 2026 16:328,06477,073,80665,928,0001,004,0002,113,536
3May 13, 2026 16:328,06776,234,13765,938,0001,019,0002,113,536
4May 13, 2026 16:328,06775,792,57065,935,0001,023,0002,113,536
5May 13, 2026 16:328,06874,810,54865,962,0001,007,0002,113,536
6May 13, 2026 16:328,06879,535,24465,947,0001,024,0002,113,536
7May 13, 2026 16:328,06976,350,37165,976,0001,004,0002,113,536
8May 13, 2026 16:328,07080,216,39865,890,0001,096,0002,113,536
9May 13, 2026 16:328,08874,787,09865,978,0001,155,0002,113,536