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 5, 2026 16:01M-RochatM-RochatScore: 28,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:0728,172248,818,754232,699,0001,131,0002,351,104
2May 5, 2026 16:0728,190252,032,056232,930,0001,052,0002,355,200
3May 5, 2026 16:0728,207249,637,580233,034,0001,090,0002,359,296
4May 5, 2026 16:0728,213253,193,695233,046,0001,126,0002,347,008
5May 5, 2026 16:0728,256253,296,344233,475,0001,056,0002,351,104
6May 5, 2026 16:0728,326248,740,514234,058,0001,051,0002,342,912
7May 5, 2026 16:0728,347250,467,914234,231,0001,051,0002,351,104
8May 5, 2026 16:0728,376251,524,700234,478,0001,047,0002,367,488
9May 5, 2026 16:0728,705255,494,878236,187,0002,069,0002,359,296