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 12, 2026 15:15Kevin HeaveyKevin HeaveyScore: 5,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:163,71040,372,89529,600,0001,200,0002,117,632
2Jul 12, 2026 15:163,72640,646,34329,906,0001,023,0002,117,632
3Jul 12, 2026 15:163,73340,639,51329,961,0001,024,0002,117,632
4Jul 12, 2026 15:165,31453,800,53343,095,0001,015,0002,117,632
5Jul 12, 2026 15:165,42354,688,34443,732,0001,286,0002,117,632
6Jul 12, 2026 15:165,43754,789,74444,120,0001,012,0002,117,632
7Jul 12, 2026 15:165,48755,187,23444,537,0001,013,0002,117,632
8Jul 12, 2026 15:165,50255,310,70944,656,0001,016,0002,117,632
9Jul 12, 2026 15:165,51155,364,19844,732,0001,012,0002,117,632