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 16, 2026 04:58Victor MerckléVictor MerckléScore: 7,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:027,12267,041,51558,111,0001,005,0002,113,536
2May 16, 2026 05:027,12968,819,65458,165,0001,012,0002,113,536
3May 16, 2026 05:027,12966,463,60158,151,0001,020,0002,113,536
4May 16, 2026 05:027,13167,660,16558,176,0001,012,0002,113,536
5May 16, 2026 05:027,13267,848,34858,180,0001,023,0002,113,536
6May 16, 2026 05:027,13366,552,32258,184,0001,020,0002,113,536
7May 16, 2026 05:027,13966,645,21858,226,0001,032,0002,113,536
8May 16, 2026 05:027,14366,580,87658,282,0001,006,0002,113,536
9May 16, 2026 05:027,17169,800,32258,524,0001,002,0002,113,536