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 listJul 27, 2025 04:27Serendipity1902Serendipity1902Score: 44,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 04:2744,803398,066,154368,870,0002,998,0002,510,848
2Jul 27, 2025 04:2744,803398,105,720369,865,0001,999,0002,396,160
3Jul 27, 2025 04:2744,808402,024,460369,906,0001,999,0002,269,184
4Jul 27, 2025 04:2744,811397,939,436369,933,0001,999,0002,269,184
5Jul 27, 2025 04:2744,813397,100,435370,953,000999,0002,269,184
6Jul 27, 2025 04:2744,821400,215,976371,011,0001,000,0002,269,184
7Jul 27, 2025 04:2744,821396,994,633371,014,0001,000,0002,281,472
8Jul 27, 2025 04:2744,826400,822,527370,056,0002,000,0002,392,064
9Jul 27, 2025 04:2744,840394,036,455372,172,00002,269,184