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 16, 2026 19:26KacpxerKacpxerScore: 7,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 19:266,95966,823,57756,741,0001,025,0002,117,632
2Oct 16, 2026 19:267,04267,551,08857,418,0001,038,0002,117,632
3Oct 16, 2026 19:267,05967,637,26857,575,0001,021,0002,117,632
4Oct 16, 2026 19:267,07767,829,89057,722,0001,025,0002,117,632
5Oct 16, 2026 19:267,08068,861,19857,686,0001,080,0002,117,632
6Oct 16, 2026 19:267,09668,028,02357,770,0001,132,0002,117,632
7Oct 16, 2026 19:267,09968,015,07757,889,0001,036,0002,117,632
8Oct 16, 2026 19:267,11668,243,26157,918,0001,153,0002,117,632
9Oct 16, 2026 19:267,12568,291,34457,976,0001,162,0002,117,632