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 11, 2026 14:17Chang Jia JunChang Jia JunScore: 106,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:17106,766894,996,507682,533,000203,631,0002,113,536
2May 11, 2026 14:17106,790895,154,963682,363,000203,998,0002,113,536
3May 11, 2026 14:17106,933898,057,816682,711,000204,837,0002,113,536
4May 11, 2026 14:17106,970898,338,290682,359,000205,495,0002,113,536
5May 11, 2026 14:17106,996897,718,051682,544,000205,530,0002,113,536
6May 11, 2026 14:17107,126899,505,072682,700,000206,446,0002,113,536
7May 11, 2026 14:17107,278899,352,141682,514,000207,895,0002,113,536
8May 11, 2026 14:17107,367901,880,194682,591,000208,559,0002,113,536
9May 11, 2026 14:17107,601902,129,115682,384,000210,709,0002,113,536