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 19:40Daniel MastalerzDaniel MastalerzScore: 8,459Success
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 19:408,30797,212,76465,954,0002,997,0002,326,528
2Feb 10, 2026 19:408,31699,577,83066,023,0003,001,0002,269,184
3Feb 10, 2026 19:408,32991,360,19867,127,0002,003,0002,519,040
4Feb 10, 2026 19:408,45993,866,40866,201,0004,012,0002,260,992
5Feb 10, 2026 19:408,46697,845,88466,256,0004,015,0002,260,992
6Feb 10, 2026 19:408,493105,306,51869,483,0001,007,0002,322,432