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 listNov 1, 2026 07:53Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 5,772Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Nov 2, 2026 14:17Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 07:535,66057,617,80443,944,0003,038,0002,113,536
2Nov 1, 2026 07:535,72658,322,00244,327,0003,201,0002,113,536
3Nov 1, 2026 07:535,76358,583,55444,612,0003,221,0002,113,536
4Nov 1, 2026 07:535,77058,620,17744,668,0003,231,0002,113,536
5Nov 1, 2026 07:535,77258,599,16144,616,0003,297,0002,113,536
6Nov 1, 2026 07:535,78158,805,63844,689,0003,301,0002,113,536
7Nov 1, 2026 07:535,79858,849,54644,845,0003,284,0002,113,536
8Nov 1, 2026 07:535,82459,124,64945,077,0003,266,0002,113,536
9Nov 1, 2026 07:535,84159,152,65345,297,0003,191,0002,113,536