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 10, 2026 14:03Victor MerckléVictor MerckléScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 14:044,50544,976,06236,369,0001,025,0002,113,536
2Jun 10, 2026 14:044,51244,952,08136,402,0001,049,0002,113,536
3Jun 10, 2026 14:044,52245,172,85036,481,0001,058,0002,113,536
4Jun 10, 2026 14:044,54345,346,23536,546,0001,163,0002,113,536
5Jun 10, 2026 14:044,55845,454,44136,760,0001,076,0002,113,536
6Jun 10, 2026 14:044,61647,064,72237,309,0001,004,0002,113,536
7Jun 10, 2026 14:044,69846,586,62537,988,0001,010,0002,113,536
8Jun 10, 2026 14:044,70546,734,93538,002,0001,052,0002,113,536
9Jun 10, 2026 14:044,71647,041,06838,076,0001,070,0002,113,536