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:20Kevin HeaveyKevin HeaveyScore: 3,882Success
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:473,66140,241,73329,340,0001,048,0002,113,536
2Jul 17, 2026 20:473,68840,446,97229,570,0001,047,0002,113,536
3Jul 17, 2026 20:473,68940,507,88929,574,0001,046,0002,113,536
4Jul 17, 2026 20:473,72842,177,72529,898,0001,048,0002,113,536
5Jul 17, 2026 20:473,88243,550,78331,063,0001,161,0002,113,536
6Jul 17, 2026 20:473,95343,245,20231,774,0001,043,0002,113,536
7Jul 17, 2026 20:473,95642,713,01831,793,0001,044,0002,113,536
8Jul 17, 2026 20:473,96243,305,33031,844,0001,045,0002,113,536
9Jul 17, 2026 20:474,00344,367,60432,182,0001,043,0002,113,536