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 listFeb 10, 2026 16:53Daniel MastalerzDaniel MastalerzScore: 9,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 16:539,610105,817,52572,788,0006,979,0002,416,640
2Feb 10, 2026 16:539,621105,660,31771,868,0007,985,0002,359,296
3Feb 10, 2026 16:539,638105,119,55169,996,0009,999,0002,523,136
4Feb 10, 2026 16:539,718111,258,32670,575,00010,082,0002,416,640
5Feb 10, 2026 16:539,738103,615,74471,843,0008,980,0002,363,392
6Feb 10, 2026 16:539,758102,004,97870,994,0009,999,0002,285,568