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 17, 2026 19:00Victor MerckléVictor MerckléScore: 25,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 19:0025,584219,984,395211,287,0001,066,0002,113,536
2Jun 17, 2026 19:0025,590220,357,585211,331,0001,069,0002,113,536
3Jun 17, 2026 19:0025,593220,400,592211,363,0001,061,0002,113,536
4Jun 17, 2026 19:0025,597220,139,464211,375,0001,081,0002,113,536
5Jun 17, 2026 19:0025,606220,225,954211,499,0001,039,0002,113,536
6Jun 17, 2026 19:0025,616220,259,842211,557,0001,061,0002,113,536
7Jun 17, 2026 19:0025,622220,282,675211,534,0001,134,0002,113,536
8Jun 17, 2026 19:0025,670221,075,082211,982,0001,085,0002,113,536
9Jun 17, 2026 19:0025,833222,061,977213,272,0001,143,0002,113,536