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 listApr 9, 2026 16:22Oleg SkinderevOleg SkinderevScore: 394,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 16:22393,6093,289,884,4713,208,992,00057,963,0002,293,760
2Apr 9, 2026 16:22393,6803,297,618,7053,202,573,00064,971,0002,293,760
3Apr 9, 2026 16:22393,7773,298,154,0543,225,373,00042,978,0002,506,752
4Apr 9, 2026 16:22394,1823,299,317,8713,207,738,00063,974,0002,510,848
5Apr 9, 2026 16:22394,3293,298,636,8073,212,949,00059,980,0002,506,752
6Apr 9, 2026 16:22394,4953,301,192,1353,192,378,00081,932,0002,285,568
7Apr 9, 2026 16:22395,2943,310,550,0143,188,000,00092,941,0002,285,568
8Apr 9, 2026 16:22395,8883,314,746,8843,207,925,00077,949,0002,285,568
9Apr 9, 2026 16:22396,5283,314,447,6093,230,214,00060,966,0002,285,568