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 16:14Joel ChongJoel ChongScore: 60,448Success
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 16:1460,431526,071,160500,576,000999,0002,285,568
2Mar 16, 2026 16:1460,434528,966,094499,604,0001,998,0002,285,568
3Mar 16, 2026 16:1460,444524,539,499499,690,0001,998,0002,285,568
4Mar 16, 2026 16:1460,448525,875,226499,720,0001,998,0002,285,568
5Mar 16, 2026 16:1460,448526,076,438499,717,0001,998,0002,285,568
6Mar 16, 2026 16:1460,458532,043,576500,806,000999,0002,285,568
7Mar 16, 2026 16:1460,465524,747,091501,856,00002,289,664
8Mar 16, 2026 16:1460,468524,542,174499,887,0001,999,0002,523,136
9Mar 16, 2026 16:1460,510528,370,182501,233,0001,000,0002,277,376