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 listOct 18, 2026 09:30KacpxerKacpxerScore: 5,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 09:305,33955,175,89343,270,0001,044,0002,117,632
2Oct 18, 2026 09:305,42855,819,71844,021,0001,037,0002,117,632
3Oct 18, 2026 09:305,51256,495,55744,726,0001,027,0002,117,632
4Oct 18, 2026 09:305,51856,598,64444,758,0001,044,0002,117,632
5Oct 18, 2026 09:305,52156,598,52044,779,0001,047,0002,117,632
6Oct 18, 2026 09:305,52456,496,33844,811,0001,043,0002,117,632
7Oct 18, 2026 09:305,58457,104,75545,301,0001,048,0002,117,632
8Oct 18, 2026 09:305,58457,074,47445,325,0001,024,0002,117,632
9Oct 18, 2026 09:305,61157,395,28945,539,0001,033,0002,117,632