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 25, 2026 16:51Kenzie_RTKenzie_RTScore: 46,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:5146,802398,523,549387,353,0001,110,0002,113,536
2May 25, 2026 16:5146,834400,250,549387,580,0001,146,0002,113,536
3May 25, 2026 16:5146,836399,182,462387,575,0001,171,0002,113,536
4May 25, 2026 16:5146,861400,941,022387,822,0001,129,0002,113,536
5May 25, 2026 16:5146,862398,821,338387,905,0001,057,0002,113,536
6May 25, 2026 16:5146,866401,022,663387,865,0001,129,0002,113,536
7May 25, 2026 16:5146,907399,690,553388,143,0001,186,0002,113,536
8May 25, 2026 16:5146,919401,488,988388,333,0001,102,0002,113,536
9May 25, 2026 16:5146,954400,752,972388,586,0001,133,0002,113,536