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 listJul 7, 2026 10:44Kevin HeaveyKevin HeaveyScore: 5,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:455,46154,982,82244,223,0001,111,0002,117,632
2Jul 7, 2026 10:455,53555,496,75844,819,0001,124,0002,117,632
3Jul 7, 2026 10:455,55555,634,39244,992,0001,120,0002,117,632
4Jul 7, 2026 10:455,60456,076,02645,373,0001,145,0002,117,632
5Jul 7, 2026 10:455,64056,611,74245,678,0001,136,0002,117,632
6Jul 7, 2026 10:455,68556,680,26646,083,0001,105,0002,117,632
7Jul 7, 2026 10:455,69956,812,42646,206,0001,099,0002,117,632
8Jul 7, 2026 10:455,81057,770,93147,110,0001,115,0002,117,632
9Jul 7, 2026 10:455,82257,823,48847,217,0001,108,0002,117,632