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 listJan 3, 2026 15:54Carlos MGCarlos MGScore: 101,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 15:54101,125865,262,599783,385,00055,956,0002,330,624
2Jan 3, 2026 15:54101,192862,253,877795,847,00044,046,0002,355,200
3Jan 3, 2026 15:54101,268868,692,189776,561,00063,963,0002,355,200
4Jan 3, 2026 15:54101,347868,739,545782,171,00059,012,0002,371,584
5Jan 3, 2026 15:54101,398868,243,987781,630,00059,971,0002,367,488
6Jan 3, 2026 15:54101,460863,525,447794,054,00048,063,0002,330,624
7Jan 3, 2026 15:54101,617869,196,437784,459,00058,959,0002,359,296
8Jan 3, 2026 15:54101,668869,092,797796,856,00046,991,0002,363,392
9Jan 3, 2026 15:54102,485879,934,277796,649,00053,976,0002,355,200