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 20:06Kevin HeaveyKevin HeaveyScore: 4,624Success
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 20:104,52347,061,82736,347,0001,198,0002,117,632
2Jul 7, 2026 20:104,61147,853,84737,094,0001,181,0002,117,632
3Jul 7, 2026 20:104,61347,914,98737,275,0001,018,0002,117,632
4Jul 7, 2026 20:104,62147,847,24437,189,0001,169,0002,117,632
5Jul 7, 2026 20:104,62447,933,03137,176,0001,205,0002,117,632
6Jul 7, 2026 20:104,66348,667,45136,126,0002,585,0002,117,632
7Jul 7, 2026 20:104,70653,188,61337,869,0001,194,0002,117,632
8Jul 7, 2026 20:104,89550,178,41037,656,0002,977,0002,117,632
9Jul 7, 2026 20:104,93950,526,98938,301,0002,700,0002,117,632