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 listMay 8, 2026 00:30flavio87flavio87Score: 11,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 00:3011,394110,337,88692,555,0002,017,0002,437,120
2May 8, 2026 00:3011,402109,079,43392,623,0002,014,0002,355,200
3May 8, 2026 00:3011,404111,391,85793,643,0001,015,0002,351,104
4May 8, 2026 00:3011,424110,493,33392,764,0002,057,0002,367,488
5May 8, 2026 00:3011,439110,910,14992,918,0002,032,0002,347,008
6May 8, 2026 00:3011,450112,978,36293,027,0002,014,0002,404,352
7May 8, 2026 00:3011,463110,993,81393,107,0002,036,0002,371,584
8May 8, 2026 00:3011,475112,538,71893,221,0002,025,0002,314,240
9May 8, 2026 00:3011,488111,082,99493,313,0002,044,0002,342,912