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 20:51Aleksei ShahoikaAleksei ShahoikaScore: 12,586Success
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 20:5212,535116,182,57782,281,00021,767,0002,113,536
2May 18, 2026 20:5212,555115,758,13482,441,00021,771,0002,113,536
3May 18, 2026 20:5212,561118,731,52582,369,00021,891,0002,113,536
4May 18, 2026 20:5212,584115,048,08682,583,00021,870,0002,113,536
5May 18, 2026 20:5212,586116,911,60982,715,00021,751,0002,113,536
6May 18, 2026 20:5212,608114,269,30182,618,00022,033,0002,113,536
7May 18, 2026 20:5212,616116,877,80482,403,00022,310,0002,113,536
8May 18, 2026 20:5212,734115,107,22882,756,00022,939,0002,113,536
9May 18, 2026 20:5212,798117,092,95283,069,00023,159,0002,113,536