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 listMar 16, 2026 15:24Joel ChongJoel ChongScore: 65,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 15:2465,803572,433,474545,163,0001,000,0002,285,568
2Mar 16, 2026 15:2465,808570,700,358545,208,0001,000,0002,519,040
3Mar 16, 2026 15:2465,810571,123,497545,221,0001,000,0002,285,568
4Mar 16, 2026 15:2465,818577,102,708545,292,0001,000,0002,285,568
5Mar 16, 2026 15:2465,822577,746,383545,321,0001,000,0002,519,040
6Mar 16, 2026 15:2465,832574,762,352544,412,0001,997,0002,273,280
7Mar 16, 2026 15:2465,835575,673,907544,437,0001,997,0002,285,568
8Mar 16, 2026 15:2465,835578,962,357545,432,0001,000,0002,523,136
9Mar 16, 2026 15:2465,890567,819,378545,889,000999,0002,281,472