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 22:53Aleksei ShahoikaAleksei ShahoikaScore: 12,084Success
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 22:5411,968110,824,56678,082,00021,257,0002,113,536
2May 18, 2026 22:5411,974109,882,06378,399,00020,986,0002,113,536
3May 18, 2026 22:5412,005109,867,75078,132,00021,516,0002,113,536
4May 18, 2026 22:5412,075114,227,46779,102,00021,122,0002,113,536
5May 18, 2026 22:5412,084110,861,59479,142,00021,160,0002,113,536
6May 18, 2026 22:5412,086110,088,55278,085,00022,234,0002,113,536
7May 18, 2026 22:5412,094111,428,31279,119,00021,269,0002,113,536
8May 18, 2026 22:5412,101110,100,86179,099,00021,342,0002,113,536
9May 18, 2026 22:5412,133111,045,57779,120,00021,587,0002,113,536