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 listAug 16, 2026 13:15marko1597marko1597Score: 5,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:375,83758,396,63047,447,0001,005,0002,113,536
2Aug 16, 2026 13:375,84258,304,73947,321,0001,170,0002,113,536
3Aug 16, 2026 13:375,88858,763,55847,713,0001,163,0002,113,536
4Aug 16, 2026 13:375,91858,933,41847,954,0001,166,0002,113,536
5Aug 16, 2026 13:375,92059,017,40747,965,0001,178,0002,113,536
6Aug 16, 2026 13:375,93259,077,79648,072,0001,169,0002,113,536
7Aug 16, 2026 13:375,94359,163,77848,326,0001,004,0002,113,536
8Aug 16, 2026 13:375,96159,280,70948,309,0001,172,0002,113,536
9Aug 16, 2026 13:375,96359,326,98448,461,0001,034,0002,113,536