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 11, 2026 03:52Josu San MartinJosu San MartinScore: 3,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 03:523,86139,722,19630,974,0001,074,0002,113,536
2May 11, 2026 03:523,86841,245,38831,042,0001,070,0002,113,536
3May 11, 2026 03:523,86840,004,13431,032,0001,073,0002,113,536
4May 11, 2026 03:523,87740,563,94731,086,0001,094,0002,113,536
5May 11, 2026 03:523,87842,163,27731,098,0001,091,0002,113,536
6May 11, 2026 03:523,88439,904,92431,180,0001,065,0002,113,536
7May 11, 2026 03:523,88441,891,33531,144,0001,094,0002,113,536
8May 11, 2026 03:523,90340,028,72931,311,0001,087,0002,113,536
9May 11, 2026 03:523,95942,852,83531,767,0001,095,0002,113,536