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 9, 2025 01:41Leon ZhaoLeon ZhaoScore: 15,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 01:4115,636161,070,962127,781,0001,996,0002,469,888
2Aug 9, 2025 01:4115,642154,378,154127,832,0001,997,0002,318,336
3Aug 9, 2025 01:4115,642155,337,887127,832,0001,997,0002,285,568
4Aug 9, 2025 01:4115,642155,516,395127,832,0001,997,0002,285,568
5Aug 9, 2025 01:4115,644156,240,927127,846,0001,997,0002,449,408
6Aug 9, 2025 01:4115,650155,554,098127,894,0001,998,0002,285,568
7Aug 9, 2025 01:4115,654163,385,432128,928,000999,0002,461,696
8Aug 9, 2025 01:4115,662159,613,620128,996,000999,0002,461,696
9Aug 9, 2025 01:4115,689151,726,348128,216,0002,003,0002,457,600