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 20:22Daniel MastalerzDaniel MastalerzScore: 6,093Success
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 20:225,99876,173,29545,800,0003,982,0002,306,048
2Feb 19, 2026 20:226,00275,285,65445,828,0003,985,0002,269,184
3Feb 19, 2026 20:226,02373,242,99245,991,0003,999,0002,310,144
4Feb 19, 2026 20:226,09377,507,73147,537,0003,034,0002,310,144
5Feb 19, 2026 20:226,10081,824,20847,590,0003,037,0002,265,088
6Feb 19, 2026 20:226,12179,511,24948,810,0001,992,0002,322,432