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 listFeb 24, 2026 21:58Mikołaj UzarskiMikołaj UzarskiScore: 5,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:585,29067,917,44941,912,0001,995,0002,281,472
2Feb 24, 2026 21:585,29169,470,82841,916,0001,996,0002,281,472
3Feb 24, 2026 21:585,29666,898,56542,959,000999,0002,498,560
4Feb 24, 2026 21:585,29969,193,71841,980,0001,999,0002,281,472
5Feb 24, 2026 21:585,29968,393,57441,983,0001,999,0002,285,568
6Feb 24, 2026 21:585,29970,100,87141,986,0001,999,0002,506,752
7Feb 24, 2026 21:585,30466,908,30743,026,0001,000,0002,285,568
8Feb 24, 2026 21:585,32767,859,19543,207,0001,004,0002,514,944
9Feb 24, 2026 21:585,38269,458,48343,656,0001,015,0002,285,568