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 10:01wnwnScore: 3,457Success
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 10:023,39743,028,36327,098,0001,105,0002,482,176
2May 7, 2026 10:023,41443,864,38127,250,0001,089,0002,482,176
3May 7, 2026 10:023,43342,643,73727,350,0001,148,0002,482,176
4May 7, 2026 10:023,43745,106,40827,427,0001,108,0002,482,176
5May 7, 2026 10:023,45744,130,49927,614,0001,080,0002,486,272
6May 7, 2026 10:023,46444,493,70927,700,0001,055,0002,486,272
7May 7, 2026 10:023,55144,524,99828,407,0001,068,0002,486,272
8May 7, 2026 10:023,57046,717,52128,569,0001,069,0002,494,464
9May 7, 2026 10:023,58644,571,15128,690,0001,076,0002,486,272