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 15, 2026 22:46Victor MerckléVictor MerckléScore: 6,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 22:466,95265,017,92456,705,0001,003,0002,113,536
2May 15, 2026 22:466,95265,007,86856,663,0001,044,0002,113,536
3May 15, 2026 22:466,95365,038,75256,667,0001,043,0002,113,536
4May 15, 2026 22:466,95467,204,47456,707,0001,013,0002,113,536
5May 15, 2026 22:466,95665,142,75056,726,0001,010,0002,113,536
6May 15, 2026 22:466,95967,324,70856,748,0001,014,0002,113,536
7May 15, 2026 22:466,96565,098,44856,786,0001,025,0002,113,536
8May 15, 2026 22:466,98067,118,77156,931,0001,009,0002,113,536
9May 15, 2026 22:467,01467,195,05257,213,0001,005,0002,113,536