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 listFeb 11, 2026 20:22olliecrowolliecrowScore: 6,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 20:225,58968,074,04342,355,0004,033,0002,420,736
2Feb 11, 2026 20:225,76470,593,80844,851,0002,990,0002,408,448
3Feb 11, 2026 20:225,80570,904,34744,164,0004,014,0002,449,408
4Feb 11, 2026 20:226,06279,194,64248,302,0002,012,0002,355,200
5Feb 11, 2026 20:226,09781,357,23048,617,0001,984,0002,510,848
6Feb 11, 2026 20:226,19779,893,30849,421,0002,017,0002,383,872