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:00Daniel MastalerzDaniel MastalerzScore: 8,488Success
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:008,44891,743,77365,114,0005,008,0002,301,952
2Feb 10, 2026 19:008,46191,573,52165,208,0005,016,0002,318,336
3Feb 10, 2026 19:008,46692,247,53367,254,0003,011,0002,486,272
4Feb 10, 2026 19:008,46995,160,14765,269,0005,020,0002,314,240
5Feb 10, 2026 19:008,47993,395,25464,346,0006,032,0002,408,448
6Feb 10, 2026 19:008,48196,986,09068,383,0002,011,0002,293,760
7Feb 10, 2026 19:008,48894,296,88964,413,0006,038,0002,408,448
8Feb 10, 2026 19:008,49396,828,57366,468,0004,028,0002,400,256
9Feb 10, 2026 19:008,53197,340,07265,824,0004,986,0002,387,968
10Feb 10, 2026 19:008,649103,020,67968,798,0002,991,0002,396,160
11Feb 10, 2026 19:008,69094,369,99969,126,0003,005,0002,506,752
12Feb 10, 2026 19:008,71095,706,90367,272,0005,020,0002,408,448