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 26, 2026 12:27Kenzie_RTKenzie_RTScore: 48,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 12:2747,717408,259,666394,891,0001,166,0002,113,536
2May 26, 2026 12:2747,761406,697,769395,360,0001,064,0002,113,536
3May 26, 2026 12:2747,901409,191,916396,423,0001,157,0002,113,536
4May 26, 2026 12:2748,253410,660,777399,363,0001,144,0002,113,536
5May 26, 2026 12:2748,627413,509,319402,433,0001,172,0002,113,536
6May 26, 2026 12:2748,660413,082,642402,811,0001,067,0002,113,536
7May 26, 2026 12:2748,691413,501,703403,077,0001,062,0002,113,536
8May 26, 2026 12:2748,765414,786,410403,681,0001,072,0002,113,536
9May 26, 2026 12:2748,819416,591,402404,143,0001,059,0002,113,536