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 listNov 2, 2025 16:13triscacezar-droidtriscacezar-droidScore: 1,987,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 16:131,985,76716,510,841,26016,408,903,00072,963,0002,277,376
2Nov 2, 2025 16:131,987,46916,528,655,00516,424,023,00071,969,0002,285,568
3Nov 2, 2025 16:131,989,33616,545,273,34116,434,527,00076,960,0002,285,568