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 10, 2026 15:07Victor MerckléVictor MerckléScore: 7,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:087,38969,068,96060,241,0001,091,0002,113,536
2Jun 10, 2026 15:087,39969,052,74560,343,0001,074,0002,113,536
3Jun 10, 2026 15:087,40269,058,57860,365,0001,079,0002,113,536
4Jun 10, 2026 15:087,40269,067,90460,292,0001,152,0002,113,536
5Jun 10, 2026 15:087,41669,834,61860,505,0001,053,0002,113,536
6Jun 10, 2026 15:087,41869,314,78560,480,0001,092,0002,113,536
7Jun 10, 2026 15:087,43069,259,59360,586,0001,083,0002,113,536
8Jun 10, 2026 15:087,43169,341,40060,578,0001,104,0002,113,536
9Jun 10, 2026 15:087,43569,143,75860,599,0001,112,0002,113,536