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 13:42Sergey SerebryakovSergey SerebryakovScore: 9,873Success
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 13:429,524106,061,49577,050,0002,001,0002,400,256
2Mar 10, 2026 13:429,538111,699,31177,161,0002,004,0002,265,088
3Mar 10, 2026 13:429,578106,298,32978,494,0001,006,0002,265,088
4Mar 10, 2026 13:429,859105,955,24180,829,000997,0002,404,352
5Mar 10, 2026 13:429,860103,272,48180,838,000998,0002,265,088
6Mar 10, 2026 13:429,867104,486,65780,896,000998,0002,265,088
7Mar 10, 2026 13:429,873102,266,98279,945,0001,998,0002,387,968
8Mar 10, 2026 13:429,874103,942,55179,956,0001,998,0002,404,352
9Mar 10, 2026 13:429,876108,818,69779,971,0001,999,0002,265,088
10Mar 10, 2026 13:429,877104,652,76978,976,0002,999,0002,510,848
11Mar 10, 2026 13:429,882104,690,16681,019,0001,000,0002,265,088
12Mar 10, 2026 13:429,912109,066,47781,267,0001,003,0002,396,160