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 20, 2026 10:29M-RochatM-RochatScore: 6,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:296,71766,002,12653,698,0002,054,0002,113,536
2May 20, 2026 10:296,72366,698,45553,731,0002,071,0002,113,536
3May 20, 2026 10:296,77765,885,58054,188,0002,069,0002,113,536
4May 20, 2026 10:296,79966,824,27454,366,0002,067,0002,113,536
5May 20, 2026 10:296,81268,022,83154,365,0002,180,0002,113,536
6May 20, 2026 10:296,81667,931,96554,405,0002,173,0002,113,536
7May 20, 2026 10:296,82666,530,08954,638,0002,024,0002,113,536
8May 20, 2026 10:296,83866,228,12654,546,0002,212,0002,113,536
9May 20, 2026 10:296,85866,853,73054,729,0002,196,0002,113,536