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 listNov 3, 2026 10:44Andrew EpsteinAndrew EpsteinScore: 101,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 10:48101,623852,890,839840,319,0003,156,0002,121,728stderr
2Nov 3, 2026 10:48101,639853,470,746841,568,0002,039,0002,121,728stderr
3Nov 3, 2026 10:48101,678853,772,043840,740,0003,189,0002,121,728stderr
4Nov 3, 2026 10:48101,792854,293,801841,788,0003,087,0002,121,728stderr
5Nov 3, 2026 10:48101,844855,174,555843,280,0002,028,0002,121,728stderr
6Nov 3, 2026 10:48101,853855,155,791843,351,0002,029,0002,121,728stderr
7Nov 3, 2026 10:48101,853855,133,349843,330,0002,057,0002,121,728stderr
8Nov 3, 2026 10:48102,162857,797,212845,901,0002,050,0002,121,728stderr
9Nov 3, 2026 10:48102,180857,844,224846,076,0002,024,0002,121,728stderr