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 19:27olliecrowolliecrowScore: 6,482Success
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 19:276,12580,387,38948,843,0001,993,0002,367,488
2Feb 11, 2026 19:276,16270,732,44748,134,0003,008,0002,314,240
3Feb 11, 2026 19:276,21177,512,35448,523,0003,032,0002,383,872
4Feb 11, 2026 19:276,48281,660,22651,811,0001,992,0002,416,640
5Feb 11, 2026 19:276,49881,943,26249,939,0003,995,0002,412,544
6Feb 11, 2026 19:276,55176,568,29252,363,0002,013,0002,342,912