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 listOct 11, 2025 03:35Marco BarboneMarco BarboneScore: 28,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:3528,230257,044,317234,305,00002,289,664
2Oct 11, 2025 03:3528,318256,966,434233,042,0002,000,0002,277,376
3Oct 11, 2025 03:3528,633264,198,280235,655,0001,997,0002,289,664
4Oct 11, 2025 03:3528,638268,125,398235,698,0001,997,0002,289,664
5Oct 11, 2025 03:3528,640263,015,017235,714,0001,997,0002,277,376
6Oct 11, 2025 03:3530,144277,520,382249,195,0001,000,0002,289,664
7Oct 11, 2025 03:3530,168277,655,270249,393,0001,001,0002,289,664
8Oct 11, 2025 03:3530,176279,145,834249,461,000997,0002,277,376
9Oct 11, 2025 03:3530,203276,600,740249,691,000998,0002,289,664