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 19, 2025 02:48Ashish AhujaAshish AhujaScore: 10,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 02:4810,469111,447,51178,900,0007,989,0002,301,952
2Aug 19, 2025 02:4810,477108,898,57780,961,0005,997,0002,490,368
3Aug 19, 2025 02:4810,494114,548,52980,092,0007,008,0002,277,376
4Aug 19, 2025 02:4810,498107,427,84180,126,0007,011,0002,285,568
5Aug 19, 2025 02:4810,522115,324,22581,313,0006,023,0002,449,408
6Aug 19, 2025 02:4810,796115,187,70681,645,0007,965,0002,277,376