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 26, 2026 21:42Daniel MastalerzDaniel MastalerzScore: 5,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:425,45466,158,28744,261,0001,005,0002,494,464
2Feb 26, 2026 21:425,46273,451,45343,323,0002,015,0002,281,472
3Feb 26, 2026 21:425,47168,641,79043,389,0002,018,0002,281,472
4Feb 26, 2026 21:425,56168,703,06944,151,0002,006,0002,506,752
5Feb 26, 2026 21:425,57472,279,69846,263,00002,514,944
6Feb 26, 2026 21:425,57670,268,03144,266,0002,012,0002,502,656