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 10, 2026 15:42Victor MerckléVictor MerckléScore: 6,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:426,22759,301,88250,673,0001,019,0002,113,536
2Jun 10, 2026 15:426,23559,345,56550,723,0001,032,0002,113,536
3Jun 10, 2026 15:426,27659,688,88249,902,0002,194,0002,113,536
4Jun 10, 2026 15:426,28159,757,91551,106,0001,030,0002,113,536
5Jun 10, 2026 15:426,28959,863,78950,149,0002,050,0002,113,536
6Jun 10, 2026 15:426,29259,854,25251,204,0001,020,0002,113,536
7Jun 10, 2026 15:426,31760,023,60950,390,0002,044,0002,113,536
8Jun 10, 2026 15:426,32260,090,29250,443,0002,033,0002,113,536
9Jun 10, 2026 15:426,32660,237,95850,449,0002,059,0002,113,536