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 7, 2026 18:51Victor MerckléVictor MerckléScore: 6,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:526,03757,589,06849,020,0001,093,0002,113,536
2Jun 7, 2026 18:526,04957,762,49249,114,0001,099,0002,113,536
3Jun 7, 2026 18:526,05357,773,91749,144,0001,099,0002,113,536
4Jun 7, 2026 18:526,05458,006,90949,157,0001,097,0002,113,536
5Jun 7, 2026 18:526,07257,994,11349,259,0001,144,0002,113,536
6Jun 7, 2026 18:526,31260,620,01451,262,0001,133,0002,113,536
7Jun 7, 2026 18:526,32860,450,73151,411,0001,114,0002,113,536
8Jun 7, 2026 18:526,34660,352,75351,655,0001,023,0002,113,536
9Jun 7, 2026 18:526,35960,565,99551,660,0001,120,0002,113,536