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 16, 2026 16:52shartgepettoshartgepettoScore: 7,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 16:527,69588,061,08460,873,0002,993,0002,478,080
2Mar 16, 2026 16:527,73185,881,45860,154,0004,010,0002,379,776
3Mar 16, 2026 16:527,74990,976,92760,297,0004,019,0002,449,408
4Mar 16, 2026 16:527,80587,347,54659,800,0004,983,0002,420,736
5Mar 16, 2026 16:527,80890,973,79258,824,0005,982,0002,367,488
6Mar 16, 2026 16:527,82493,040,23257,944,0006,993,0002,486,272
7Mar 16, 2026 16:527,82890,272,06861,978,0002,998,0002,387,968
8Mar 16, 2026 16:527,83887,383,86660,051,0005,004,0002,371,584
9Mar 16, 2026 16:527,89093,273,23360,452,0005,037,0002,486,272