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 19, 2026 02:25Josu San MartinJosu San MartinScore: 6,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 02:255,84373,278,07646,481,0002,020,0002,293,760
2Feb 19, 2026 02:256,00172,437,23846,763,0003,049,0002,289,664
3Feb 19, 2026 02:256,17273,303,67148,213,0003,013,0002,293,760
4Feb 19, 2026 02:256,19571,418,70049,402,0002,016,0002,297,856
5Feb 19, 2026 02:256,33279,082,43950,537,0002,021,0002,277,376
6Feb 19, 2026 02:256,36178,904,50550,804,0001,992,0002,297,856