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 17, 2026 06:57Charles CabergsCharles CabergsScore: 100,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 06:57100,405862,440,747829,365,0003,996,0002,281,472
2Apr 17, 2026 06:57100,416859,242,150830,456,0002,998,0002,293,760
3Apr 17, 2026 06:57100,417859,526,000831,465,0001,998,0002,281,472
4Apr 17, 2026 06:57100,421862,066,285831,497,0001,998,0002,281,472
5Apr 17, 2026 06:57100,426858,033,920830,540,0002,998,0002,289,664
6Apr 17, 2026 06:57100,427856,844,166830,549,0002,998,0002,289,664
7Apr 17, 2026 06:57100,427859,308,997831,546,0001,998,0002,523,136
8Apr 17, 2026 06:57100,440858,333,856832,651,000999,0002,269,184
9Apr 17, 2026 06:57100,465861,168,787831,858,0001,999,0002,281,472