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 15:31Sergey SerebryakovSergey SerebryakovScore: 8,284Success
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 15:317,77587,099,80563,522,0001,008,0002,404,352
2Mar 10, 2026 15:317,80889,369,27462,813,0001,994,0002,400,256
3Mar 10, 2026 15:317,89191,566,56265,496,00002,273,280
4Mar 10, 2026 15:318,25989,244,10567,541,0001,008,0002,404,352
5Mar 10, 2026 15:318,26295,467,70567,567,0001,008,0002,273,280
6Mar 10, 2026 15:318,26695,070,94567,599,0001,008,0002,273,280
7Mar 10, 2026 15:318,28497,196,48167,764,000996,0002,269,184
8Mar 10, 2026 15:318,28898,619,37466,794,0001,993,0002,273,280
9Mar 10, 2026 15:318,28898,168,79166,800,0001,994,0002,273,280
10Mar 10, 2026 15:318,28995,623,80166,807,0001,994,0002,404,352
11Mar 10, 2026 15:318,29190,961,10767,817,000997,0002,392,064
12Mar 10, 2026 15:318,32991,206,35567,129,0002,003,0002,396,160