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 22, 2025 21:05Adam FolwarcznyAdam FolwarcznyScore: 18,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 21:0418,185175,295,473148,939,0001,999,0002,449,408
2Aug 22, 2025 21:0418,185172,190,653148,935,0001,999,0002,437,120
3Aug 22, 2025 21:0418,187170,599,974148,949,0001,999,0002,269,184
4Aug 22, 2025 21:0518,187169,842,934148,951,0001,999,0002,441,216
5Aug 22, 2025 21:0518,189176,861,469148,971,0001,999,0002,441,216
6Aug 22, 2025 21:0518,196170,930,923149,029,0002,000,0002,531,328