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 24, 2026 20:30Daniel MastalerzDaniel MastalerzScore: 5,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:305,41667,736,88240,957,0003,995,0002,273,280
2Feb 24, 2026 20:305,41866,518,00840,976,0003,997,0002,371,584
3Feb 24, 2026 20:305,46272,095,46541,302,0004,029,0002,269,184
4Feb 24, 2026 20:305,50174,939,31342,617,0003,044,0002,310,144
5Feb 24, 2026 20:305,51773,135,57241,809,0003,981,0002,301,952
6Feb 24, 2026 20:305,53070,446,25241,906,0003,991,0002,310,144