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 listJun 12, 2026 15:05Victor MerckléVictor MerckléScore: 10,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 15:059,99590,645,28080,835,0002,129,0002,113,536
2Jun 12, 2026 15:0510,03790,927,75281,128,0002,181,0002,113,536
3Jun 12, 2026 15:0510,04891,348,90281,219,0002,186,0002,113,536
4Jun 12, 2026 15:0510,11991,546,31881,808,0002,184,0002,113,536
5Jun 12, 2026 15:0510,13891,747,44281,947,0002,201,0002,113,536
6Jun 12, 2026 15:0510,19792,367,05982,442,0002,201,0002,113,536
7Jun 12, 2026 15:0510,20093,457,74382,419,0002,244,0002,113,536
8Jun 12, 2026 15:0510,20392,347,68982,450,0002,237,0002,113,536
9Jun 12, 2026 15:0510,23792,658,07682,831,0002,141,0002,113,536