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 1, 2026 21:42Maya RebholzMaya RebholzScore: 7,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 21:437,04168,102,03453,002,0005,440,0002,117,632
2Jun 1, 2026 21:437,05467,815,44553,198,0005,358,0002,117,632
3Jun 1, 2026 21:437,05967,753,29053,493,0005,102,0002,113,536
4Jun 1, 2026 21:437,10568,201,81553,896,0005,079,0002,113,536
5Jun 1, 2026 21:437,10868,652,26453,298,0005,700,0002,117,632
6Jun 1, 2026 21:437,13268,393,88553,880,0005,319,0002,117,632
7Jun 1, 2026 21:437,30469,994,48955,280,0005,345,0002,117,632
8Jun 1, 2026 21:437,31969,928,70255,617,0005,133,0002,117,632
9Jun 1, 2026 21:437,45271,030,69056,557,0005,298,0002,117,632