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 18, 2026 14:21wnwnScore: 3,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 14:213,28636,924,01026,258,0001,019,0002,113,536
2May 18, 2026 14:213,29337,185,12426,306,0001,031,0002,113,536
3May 18, 2026 14:213,30135,163,09826,398,0001,005,0002,113,536
4May 18, 2026 14:213,30637,046,43626,441,0001,007,0002,113,536
5May 18, 2026 14:213,37838,012,32527,012,0001,031,0002,113,536
6May 18, 2026 14:213,44338,772,74427,565,0001,012,0002,113,536
7May 18, 2026 14:213,45437,008,03427,666,0001,005,0002,113,536
8May 18, 2026 14:213,45538,108,33827,675,0001,007,0002,113,536
9May 18, 2026 14:213,45737,040,80627,692,0001,003,0002,113,536