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 listMay 10, 2026 13:32Josu San MartinJosu San MartinScore: 4,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:324,34243,307,08635,006,0001,033,0002,113,536
2May 10, 2026 13:324,34743,792,93935,061,0001,022,0002,113,536
3May 10, 2026 13:324,35145,603,18835,083,0001,031,0002,113,536
4May 10, 2026 13:324,35543,551,51335,117,0001,036,0002,113,536
5May 10, 2026 13:324,35643,431,62035,141,0001,015,0002,113,536
6May 10, 2026 13:324,35844,860,06935,139,0001,033,0002,113,536
7May 10, 2026 13:324,36844,579,56235,228,0001,032,0002,113,536
8May 10, 2026 13:324,38246,929,54935,350,0001,025,0002,113,536
9May 10, 2026 13:324,42944,487,85635,731,0001,031,0002,113,536