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 listAug 15, 2026 21:53marko1597marko1597Score: 95,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:5794,558794,952,717783,680,0001,153,0002,117,632stderr
2Aug 15, 2026 21:5794,581795,813,112783,808,0001,220,0002,117,632stderr
3Aug 15, 2026 21:5794,888797,584,712786,571,0001,001,0002,117,632stderr
4Aug 15, 2026 21:5795,207800,344,542788,948,0001,273,0002,117,632stderr
5Aug 15, 2026 21:5795,731805,390,748793,567,0001,004,0002,117,632stderr
6Aug 15, 2026 21:5795,782805,155,508793,990,0001,002,0002,117,632stderr
7Aug 15, 2026 21:5795,785805,846,086794,022,0001,001,0002,117,632stderr
8Aug 15, 2026 21:5795,819812,493,543794,051,0001,251,0002,117,632stderr
9Aug 15, 2026 21:5795,975819,227,845795,599,0001,001,0002,117,632stderr