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 4, 2025 04:19thatmagicalcatthatmagicalcatScore: 98,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 04:1997,905838,909,658811,611,000999,0002,355,200
2Jun 4, 2025 04:1997,973835,219,690812,175,0001,000,0002,363,392
3Jun 4, 2025 04:1998,014843,909,263811,519,0001,998,0002,351,104
4Jun 4, 2025 04:1998,129842,807,218812,472,0001,998,0002,351,104
5Jun 4, 2025 04:1998,145845,300,475812,604,0001,999,0002,355,200
6Jun 4, 2025 04:1998,162838,501,783813,744,000999,0002,281,472
7Jun 4, 2025 04:1998,247844,887,761813,449,0001,998,0002,281,472
8Jun 4, 2025 04:1998,326847,056,330815,105,0001,000,0002,445,312
9Jun 4, 2025 04:1998,347843,420,459814,282,0002,000,0002,355,200