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 29, 2026 09:24Victor MerckléVictor MerckléScore: 4,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 09:254,18542,598,16633,670,0001,068,0002,113,536
2Jun 29, 2026 09:254,27943,380,98734,373,0001,146,0002,113,536
3Jun 29, 2026 09:254,36043,979,17935,051,0001,142,0002,113,536
4Jun 29, 2026 09:254,50045,229,29936,332,0001,018,0002,113,536
5Jun 29, 2026 09:254,56245,767,70136,835,0001,034,0002,113,536
6Jun 29, 2026 09:254,61146,188,23237,154,0001,123,0002,113,536
7Jun 29, 2026 09:254,68146,739,89237,810,0001,048,0002,113,536
8Jun 29, 2026 09:254,83648,015,09239,010,0001,130,0002,113,536
9Jun 29, 2026 09:255,52153,647,99344,787,0001,040,0002,113,536