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 13:50Daniel MastalerzDaniel MastalerzScore: 5,637Success
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 13:505,60469,478,04643,483,0003,033,0002,514,944
2Feb 21, 2026 13:505,60979,444,99643,516,0003,036,0002,326,528
3Feb 21, 2026 13:505,61880,244,25544,605,0002,027,0002,265,088
4Feb 21, 2026 13:505,62074,298,59043,603,0003,042,0002,326,528
5Feb 21, 2026 13:505,62973,054,68442,745,0003,976,0002,269,184
6Feb 21, 2026 13:505,63572,708,45542,791,0003,980,0002,326,528
7Feb 21, 2026 13:505,63775,378,09143,802,0002,986,0002,306,048
8Feb 21, 2026 13:505,64073,514,92642,831,0003,984,0002,523,136
9Feb 21, 2026 13:505,67175,208,96244,069,0003,004,0002,301,952
10Feb 21, 2026 13:505,67769,548,80144,109,0003,007,0002,297,856
11Feb 21, 2026 13:505,68872,013,19543,193,0004,018,0002,318,336
12Feb 21, 2026 13:505,83678,776,47744,402,0004,036,0002,326,528