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 22, 2026 09:57Kevin HeaveyKevin HeaveyScore: 68,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 10:0567,755575,400,871560,349,0002,018,0002,117,632
2Jul 22, 2026 10:0567,836573,127,271561,034,0002,005,0002,117,632
3Jul 22, 2026 10:0567,862575,571,746561,257,0002,003,0002,117,632
4Jul 22, 2026 10:0567,940573,930,755561,859,0002,043,0002,117,632
5Jul 22, 2026 10:0568,004579,776,878562,350,0002,085,0002,117,632
6Jul 22, 2026 10:0568,230576,989,173564,289,0002,024,0002,117,632
7Jul 22, 2026 10:0568,869581,572,149569,470,0002,148,0002,117,632
8Jul 22, 2026 10:0571,817616,219,322593,778,0002,309,0002,121,728
9Jul 22, 2026 10:0571,912611,432,596594,824,0002,050,0002,117,632