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:31KacpxerKacpxerScore: 6,460Success
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:326,24961,265,68550,714,0001,157,0002,117,632
2Oct 18, 2026 09:326,35462,038,48551,709,0001,031,0002,117,632
3Oct 18, 2026 09:326,36762,221,31851,673,0001,179,0002,117,632
4Oct 18, 2026 09:326,43562,689,92452,378,0001,033,0002,117,632
5Oct 18, 2026 09:326,46063,247,44752,442,0001,180,0002,117,632
6Oct 18, 2026 09:326,46963,005,00552,531,0001,165,0002,117,632
7Oct 18, 2026 09:326,47063,020,08452,537,0001,170,0002,117,632
8Oct 18, 2026 09:326,48263,275,93652,614,0001,190,0002,117,632
9Oct 18, 2026 09:326,49363,151,52552,879,0001,021,0002,117,632