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 09:55wnwnScore: 3,403Success
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 09:563,38242,176,12426,982,0001,095,0002,490,368
2May 7, 2026 09:563,39045,219,27427,066,0001,078,0002,486,272
3May 7, 2026 09:563,39845,210,59827,109,0001,098,0002,490,368
4May 7, 2026 09:563,39944,520,17227,134,0001,079,0002,490,368
5May 7, 2026 09:563,40346,204,89727,192,0001,059,0002,486,272
6May 7, 2026 09:563,49045,637,97227,866,0001,106,0002,490,368
7May 7, 2026 09:563,49447,585,93827,906,0001,101,0002,486,272
8May 7, 2026 09:563,51152,978,48428,037,0001,105,0002,473,984
9May 7, 2026 09:563,51548,157,62228,089,0001,093,0002,473,984