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 20:12Kevin HeaveyKevin HeaveyScore: 3,947Success
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 20:233,66041,606,85929,334,0001,047,0002,113,536
2Jul 17, 2026 20:233,71347,887,71529,777,0001,047,0002,117,632
3Jul 17, 2026 20:233,90242,235,90531,350,0001,043,0002,113,536
4Jul 17, 2026 20:233,94352,544,57031,709,0001,023,0002,113,536
5Jul 17, 2026 20:233,94742,685,27931,718,0001,044,0002,113,536
6Jul 17, 2026 20:233,97842,920,75531,975,0001,045,0002,113,536
7Jul 17, 2026 20:234,00044,315,07732,165,0001,042,0002,113,536
8Jul 17, 2026 20:234,00544,411,58632,199,0001,049,0002,113,536
9Jul 17, 2026 20:234,02043,108,42932,326,0001,048,0002,113,536