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 listSep 17, 2026 00:29Andrew EpsteinAndrew EpsteinScore: 5,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:295,58056,666,45544,269,0002,047,0002,121,728stderr
2Sep 17, 2026 00:295,58056,859,41744,270,0002,050,0002,121,728stderr
3Sep 17, 2026 00:295,59056,757,56744,173,0002,227,0002,121,728stderr
4Sep 17, 2026 00:295,59056,777,44944,358,0002,041,0002,121,728stderr
5Sep 17, 2026 00:295,59356,800,56944,385,0002,043,0002,121,728stderr
6Sep 17, 2026 00:295,68957,569,81945,175,0002,045,0002,121,728stderr
7Sep 17, 2026 00:295,73457,872,92545,555,0002,040,0002,121,728stderr
8Sep 17, 2026 00:295,74358,695,52045,631,0002,041,0002,121,728stderr
9Sep 17, 2026 00:295,74959,585,27445,678,0002,041,0002,121,728stderr