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 21, 2026 18:47Daniel MastalerzDaniel MastalerzScore: 5,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:475,63868,866,39742,813,0003,982,0002,326,528
2Feb 21, 2026 18:475,64569,340,77142,863,0003,987,0002,326,528
3Feb 21, 2026 18:475,67470,728,74543,089,0004,008,0002,326,528
4Feb 21, 2026 18:475,72374,034,55744,467,0003,031,0002,318,336
5Feb 21, 2026 18:475,72468,277,56644,480,0003,032,0002,318,336
6Feb 21, 2026 18:475,74275,996,16544,619,0003,042,0002,519,040