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 listJan 27, 2026 19:38Garrett WalkerGarrett WalkerScore: 269,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2026 19:38269,3962,266,599,4532,158,020,00077,964,0002,330,624
2Jan 27, 2026 19:38269,5872,263,279,2362,128,640,000108,930,0002,437,120
3Jan 27, 2026 19:38269,6052,268,972,3482,127,783,000109,937,0002,330,624
4Jan 27, 2026 19:38269,6222,267,572,2712,143,913,00093,952,0002,330,624
5Jan 27, 2026 19:38269,6642,266,722,2162,143,242,00094,966,0002,330,624
6Jan 27, 2026 19:38269,7872,269,976,1352,147,262,00091,968,0002,330,624
7Jan 27, 2026 19:38269,8432,261,781,7202,136,757,000102,940,0002,330,624
8Jan 27, 2026 19:38270,0812,273,639,2022,146,732,00094,943,0002,330,624
9Jan 27, 2026 19:38270,5052,266,323,0142,157,224,00087,968,0002,330,624