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 listFeb 23, 2026 17:37satoru.netsatoru.netScore: 34,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 17:3733,847308,040,056278,935,0001,999,0002,359,296
2Feb 23, 2026 17:3733,849315,785,164279,949,000999,0002,359,296
3Feb 23, 2026 17:3733,958306,924,022280,855,000999,0002,473,984
4Feb 23, 2026 17:3734,012306,385,134282,297,00002,338,816
5Feb 23, 2026 17:3734,023322,690,749282,395,00002,355,200
6Feb 23, 2026 17:3734,128307,948,121283,264,00002,359,296
7Feb 23, 2026 17:3734,132308,079,865283,296,00002,359,296
8Feb 23, 2026 17:3734,141308,797,417283,370,00002,359,296
9Feb 23, 2026 17:3734,174308,804,350282,646,000998,0002,342,912