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 listSep 7, 2026 15:15Kevin PetersKevin PetersScore: 67,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1567,527571,598,156503,481,00057,001,0002,113,536
2Sep 7, 2026 15:1567,581571,556,726503,279,00057,649,0002,113,536
3Sep 7, 2026 15:1567,625571,281,801503,789,00057,506,0002,113,536
4Sep 7, 2026 15:1567,650572,099,522503,386,00058,112,0002,113,536
5Sep 7, 2026 15:1567,695572,459,596503,631,00058,244,0002,113,536
6Sep 7, 2026 15:1567,707572,696,110503,683,00058,289,0002,113,536
7Sep 7, 2026 15:1567,719572,603,875503,586,00058,486,0002,113,536
8Sep 7, 2026 15:1567,841573,723,206503,795,00059,289,0002,113,536
9Sep 7, 2026 15:1567,906573,595,473502,555,00061,072,0002,113,536