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 listMar 23, 2026 02:56Alyssa VerkadeAlyssa VerkadeScore: 73,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 02:5673,081636,580,667605,577,000999,0002,367,488
2Mar 23, 2026 02:5673,101634,611,319604,737,0001,999,0002,359,296
3Mar 23, 2026 02:5673,103637,409,086605,756,000999,0002,289,664
4Mar 23, 2026 02:5673,116631,651,368605,864,000999,0002,289,664
5Mar 23, 2026 02:5673,135627,644,032605,020,0002,000,0002,465,792
6Mar 23, 2026 02:5673,148635,502,610606,131,0001,000,0002,289,664
7Mar 23, 2026 02:5673,152633,208,233606,159,0001,000,0002,289,664
8Mar 23, 2026 02:5673,164638,357,769606,259,0001,000,0002,281,472
9Mar 23, 2026 02:5673,214635,402,659605,675,0001,998,0002,355,200