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 listMar 10, 2026 18:23Sergey SerebryakovSergey SerebryakovScore: 7,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:237,60089,037,85161,076,0002,002,0002,404,352
2Mar 10, 2026 18:237,60086,294,78262,077,0001,001,0002,506,752
3Mar 10, 2026 18:237,60182,181,10660,081,0003,004,0002,408,448
4Mar 10, 2026 18:237,95689,226,54964,035,0002,001,0002,506,752
5Mar 10, 2026 18:237,95990,704,32365,059,0001,000,0002,392,064
6Mar 10, 2026 18:237,96090,963,87264,064,0002,002,0002,269,184
7Mar 10, 2026 18:237,96287,231,46563,078,0003,003,0002,269,184
8Mar 10, 2026 18:237,96687,311,00065,118,0001,001,0002,396,160
9Mar 10, 2026 18:237,96686,625,74963,116,0003,005,0002,404,352
10Mar 10, 2026 18:237,96888,853,06463,127,0003,006,0002,392,064
11Mar 10, 2026 18:237,96988,935,97465,142,0001,002,0002,265,088
12Mar 10, 2026 18:237,98191,659,53264,233,0002,007,0002,265,088