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 listMay 7, 2026 08:48wnwnScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:493,38241,290,38627,009,0001,066,0002,482,176
2May 7, 2026 08:493,38342,030,56927,014,0001,068,0002,490,368
3May 7, 2026 08:493,39542,820,24927,115,0001,070,0002,478,080
4May 7, 2026 08:493,39843,190,18227,113,0001,093,0002,490,368
5May 7, 2026 08:493,40146,628,90127,103,0001,127,0002,494,464
6May 7, 2026 08:493,40843,884,80127,186,0001,104,0002,478,080
7May 7, 2026 08:493,56145,829,06828,503,0001,059,0002,486,272
8May 7, 2026 08:493,59946,300,51328,747,0001,130,0002,486,272
9May 7, 2026 08:493,63657,195,01729,097,0001,084,0002,494,464