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 02:01FrederickFrederickScore: 9,287Success
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 02:029,15187,078,78073,900,0002,061,0002,117,632
2Oct 5, 2026 02:029,16287,231,09174,027,0002,019,0002,117,632
3Oct 5, 2026 02:029,21487,702,72874,442,0002,041,0002,117,632
4Oct 5, 2026 02:029,27787,481,85074,980,0002,027,0002,117,632
5Oct 5, 2026 02:029,28788,945,13775,059,0002,025,0002,117,632
6Oct 5, 2026 02:029,33088,098,56975,426,0002,021,0002,117,632
7Oct 5, 2026 02:029,37288,866,02275,765,0002,023,0002,117,632
8Oct 5, 2026 02:029,46088,989,36076,501,0002,023,0002,117,632
9Oct 5, 2026 02:029,50090,100,39976,808,0002,045,0002,117,632