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 17, 2026 18:29Kevin HeaveyKevin HeaveyScore: 3,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:303,71240,622,94829,584,0001,233,0002,117,632
2Jul 17, 2026 18:303,76841,000,47130,235,0001,044,0002,117,632
3Jul 17, 2026 18:303,82741,516,93230,720,0001,047,0002,117,632
4Jul 17, 2026 18:303,84241,658,24330,847,0001,044,0002,117,632
5Jul 17, 2026 18:303,86641,851,98831,042,0001,046,0002,117,632
6Jul 17, 2026 18:303,89342,081,42631,276,0001,041,0002,117,632
7Jul 17, 2026 18:303,92142,298,13831,507,0001,045,0002,117,632
8Jul 17, 2026 18:303,93142,356,20031,593,0001,039,0002,117,632
9Jul 17, 2026 18:303,95742,566,89531,803,0001,041,0002,117,632