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 listJun 29, 2026 05:28Victor MerckléVictor MerckléScore: 4,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 05:294,70546,978,40437,968,0001,084,0002,113,536
2Jun 29, 2026 05:294,77647,526,56738,584,0001,065,0002,113,536
3Jun 29, 2026 05:294,77747,632,27938,543,0001,107,0002,113,536
4Jun 29, 2026 05:294,78047,659,07338,550,0001,129,0002,113,536
5Jun 29, 2026 05:294,78347,647,49138,601,0001,103,0002,113,536
6Jun 29, 2026 05:294,80447,828,88738,863,0001,014,0002,113,536
7Jun 29, 2026 05:294,81747,903,50438,962,0001,024,0002,113,536
8Jun 29, 2026 05:294,82848,036,13738,989,0001,088,0002,113,536
9Jun 29, 2026 05:294,85248,168,41839,237,0001,040,0002,113,536