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 18, 2026 11:53wnwnScore: 7,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:536,21275,224,50049,540,0002,022,0002,314,240
2Feb 18, 2026 11:536,24979,005,47749,870,0001,994,0002,506,752
3Feb 18, 2026 11:536,26879,341,83449,023,0003,001,0002,449,408
4Feb 18, 2026 11:537,44989,313,77560,815,0001,013,0002,371,584
5Feb 18, 2026 11:537,49888,973,54760,227,0002,007,0002,437,120
6Feb 18, 2026 11:537,52383,341,87858,415,0004,028,0002,433,024