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 15, 2026 00:58Kevin HeaveyKevin HeaveyScore: 3,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:593,73940,739,59429,836,0001,203,0002,117,632
2Jul 15, 2026 00:593,75940,777,96829,922,0001,280,0002,117,632
3Jul 15, 2026 00:593,76240,849,68230,207,0001,024,0002,117,632
4Jul 15, 2026 00:593,79341,131,89330,264,0001,220,0002,117,632
5Jul 15, 2026 00:593,79341,103,19430,441,0001,041,0002,117,632
6Jul 15, 2026 00:593,81341,291,70430,434,0001,220,0002,117,632
7Jul 15, 2026 00:593,82041,384,67830,676,0001,036,0002,117,632
8Jul 15, 2026 00:593,83341,388,65830,796,0001,024,0002,117,632
9Jul 15, 2026 00:593,84941,595,57730,907,0001,044,0002,117,632