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 listSep 8, 2026 12:42Victor MerckléVictor MerckléScore: 4,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 12:453,93641,209,65229,080,0003,596,0002,117,632stderr
2Sep 8, 2026 12:453,98241,579,72130,561,0002,495,00024,576stderr
3Sep 8, 2026 12:453,98341,505,49430,718,0002,346,00024,576stderr
4Sep 8, 2026 12:454,00741,690,13529,435,0003,829,0002,117,632stderr
5Sep 8, 2026 12:454,01342,596,93930,961,0002,350,00024,576stderr
6Sep 8, 2026 12:454,01641,800,30029,766,0003,570,0002,117,632stderr
7Sep 8, 2026 12:454,01941,837,95229,891,0003,474,0002,117,632stderr
8Sep 8, 2026 12:454,03342,089,15631,064,0002,418,00024,576stderr
9Sep 8, 2026 12:454,03744,021,34731,094,0002,419,00024,576stderr