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 listApr 26, 2026 16:13wnwnScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:133,39344,639,41327,162,0001,006,0002,330,624
2Apr 26, 2026 16:133,45750,411,68726,716,0001,979,0002,486,272
3Apr 26, 2026 16:133,46045,166,54427,701,0001,025,0002,478,080
4Apr 26, 2026 16:133,46947,039,33026,812,0001,986,0002,486,272
5Apr 26, 2026 16:133,47244,452,46126,831,0001,987,0002,326,528
6Apr 26, 2026 16:133,54047,884,28728,373,0001,013,0002,330,624
7Apr 26, 2026 16:133,57344,319,04728,642,0001,022,0002,478,080
8Apr 26, 2026 16:133,60846,439,11427,956,0001,996,0002,494,464
9Apr 26, 2026 16:133,66547,758,80129,410,0001,014,0002,486,272