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 listJun 19, 2026 16:36A_ShamanA_ShamanScore: 76,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:3675,976639,731,945565,895,00064,711,0002,113,536
2Jun 19, 2026 16:3676,085640,671,367565,159,00066,349,0002,113,536
3Jun 19, 2026 16:3676,088640,768,911565,262,00066,269,0002,113,536
4Jun 19, 2026 16:3676,150641,318,348566,285,00065,763,0002,113,536
5Jun 19, 2026 16:3676,163641,433,327565,687,00066,469,0002,113,536
6Jun 19, 2026 16:3676,386643,630,105567,439,00066,568,0002,113,536
7Jun 19, 2026 16:3676,719646,276,531568,202,00068,568,0002,113,536
8Jun 19, 2026 16:3676,722645,938,133568,177,00068,621,0002,113,536
9Jun 19, 2026 16:3676,924647,631,276568,360,00070,110,0002,113,536