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:11Adam FolwarcznyAdam FolwarcznyScore: 18,188Success
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:1118,188174,880,974148,960,0001,999,0002,433,024
2Aug 22, 2025 21:1118,188177,603,585148,963,0001,999,0002,437,120
3Aug 22, 2025 21:1118,192175,666,678148,994,0001,999,0002,531,328