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 listMay 7, 2026 09:58wnwnScore: 3,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 09:593,41545,395,88327,240,0001,106,0002,486,272
2May 7, 2026 09:593,42944,257,85127,347,0001,114,0002,486,272
3May 7, 2026 09:593,57744,758,41328,612,0001,080,0002,490,368
4May 7, 2026 09:593,59046,638,48028,684,0001,119,0002,490,368
5May 7, 2026 09:593,59044,343,21928,741,0001,063,0002,478,080
6May 7, 2026 09:593,59545,230,90728,764,0001,081,0002,478,080
7May 7, 2026 09:593,60547,102,22628,828,0001,099,0002,482,176
8May 7, 2026 09:593,61247,010,56728,895,0001,092,0002,486,272
9May 7, 2026 09:593,61243,604,01928,903,0001,077,0002,478,080