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 listMar 18, 2026 00:17Elijah KinElijah KinScore: 65,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 00:1765,655571,492,405483,946,00060,993,0002,285,568
2Mar 18, 2026 00:1765,675568,757,338487,090,00058,010,0002,285,568
3Mar 18, 2026 00:1765,684567,413,508495,165,00050,016,0002,285,568
4Mar 18, 2026 00:1765,687568,293,887487,182,00058,021,0002,486,272
5Mar 18, 2026 00:1765,703573,170,534494,300,00051,031,0002,289,664
6Mar 18, 2026 00:1765,716573,092,869490,400,00055,044,0002,285,568
7Mar 18, 2026 00:1765,723571,642,768486,557,00058,946,0002,482,176
8Mar 18, 2026 00:1765,734576,839,154481,641,00063,952,0002,478,080
9Mar 18, 2026 00:1765,821568,929,870484,276,00062,035,0002,277,376