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: 5,301Success
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:315,27554,679,96742,704,0001,084,0002,117,632
2Oct 18, 2026 09:315,27954,667,72242,734,0001,083,0002,117,632
3Oct 18, 2026 09:315,29754,956,00542,897,0001,076,0002,117,632
4Oct 18, 2026 09:315,30055,010,12642,917,0001,076,0002,117,632
5Oct 18, 2026 09:315,30155,425,29742,922,0001,078,0002,117,632
6Oct 18, 2026 09:315,31454,935,52243,054,0001,054,0002,117,632
7Oct 18, 2026 09:315,35255,302,42743,401,0001,024,0002,117,632
8Oct 18, 2026 09:315,35955,415,58043,454,0001,027,0002,117,632
9Oct 18, 2026 09:315,40756,404,86143,806,0001,080,0002,117,632