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 26, 2026 08:54Victor MerckléVictor MerckléScore: 4,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:574,90248,237,38639,564,0001,129,0002,113,536
2Jun 26, 2026 08:574,91948,409,79939,784,0001,049,0002,113,536
3Jun 26, 2026 08:574,93248,469,12039,884,0001,057,0002,113,536
4Jun 26, 2026 08:574,93448,491,82439,909,0001,046,0002,113,536
5Jun 26, 2026 08:574,93748,738,05739,847,0001,135,0002,113,536
6Jun 26, 2026 08:574,95448,663,63340,015,0001,110,0002,113,536
7Jun 26, 2026 08:574,96157,366,04340,030,0001,147,0002,113,536
8Jun 26, 2026 08:574,98748,943,42240,309,0001,090,0002,113,536
9Jun 26, 2026 08:575,03349,366,21840,752,0001,030,0002,113,536