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 24, 2026 11:50Victor MerckléVictor MerckléScore: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:514,58147,002,72736,961,0001,066,0002,113,536
2May 24, 2026 11:514,58248,799,60436,959,0001,077,0002,113,536
3May 24, 2026 11:514,58647,026,92337,062,0001,009,0002,113,536
4May 24, 2026 11:514,59050,678,03837,102,0001,001,0002,113,536
5May 24, 2026 11:514,59045,890,52837,093,0001,007,0002,113,536
6May 24, 2026 11:514,59245,923,41237,092,0001,028,0002,113,536
7May 24, 2026 11:514,59346,249,54337,093,0001,030,0002,113,536
8May 24, 2026 11:514,59946,014,32837,171,0001,007,0002,113,536
9May 24, 2026 11:514,61146,912,89437,209,0001,066,0002,113,536