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 5, 2026 01:43FrederickFrederickScore: 9,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:439,24987,232,23574,721,0002,046,0002,117,632
2Oct 5, 2026 01:439,25087,193,00774,659,0002,120,0002,117,632
3Oct 5, 2026 01:439,27787,546,85074,886,0002,119,0002,117,632
4Oct 5, 2026 01:439,30787,766,95775,194,0002,060,0002,117,632
5Oct 5, 2026 01:439,35090,239,52575,487,0002,122,0002,117,632
6Oct 5, 2026 01:439,47289,006,16476,563,0002,060,0002,117,632
7Oct 5, 2026 01:439,49789,285,44876,766,0002,063,0002,117,632
8Oct 5, 2026 01:439,61991,102,56077,721,0002,121,0002,117,632
9Oct 5, 2026 01:439,64991,239,77077,980,0002,112,0002,117,632