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 19, 2026 22:15Daniel MastalerzDaniel MastalerzScore: 5,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:155,80079,250,39845,132,0003,008,0002,265,088
2Feb 19, 2026 22:155,80278,484,78445,150,0003,010,0002,273,280
3Feb 19, 2026 22:155,88178,671,11044,830,0003,984,0002,314,240
4Feb 19, 2026 22:155,90674,954,01746,016,0003,001,0002,310,144
5Feb 19, 2026 22:155,90873,910,35944,031,0005,003,0002,269,184
6Feb 19, 2026 22:155,91371,764,30546,072,0003,004,0002,273,280