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 listSep 1, 2026 09:54C#_userC#_userScore: 64,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 09:5764,751547,180,492480,752,00056,688,0002,138,112
2Sep 1, 2026 09:5764,803547,573,420481,376,00056,491,0002,162,688
3Sep 1, 2026 09:5764,822547,829,694481,309,00056,720,0002,142,208
4Sep 1, 2026 09:5764,829547,749,110480,504,00057,584,0002,203,648
5Sep 1, 2026 09:5764,839547,931,366481,564,00056,604,0002,142,208
6Sep 1, 2026 09:5764,908548,495,755482,251,00056,493,0002,142,208
7Sep 1, 2026 09:5764,910551,099,131481,272,00057,487,0002,142,208
8Sep 1, 2026 09:5764,926548,607,899481,273,00057,618,0002,142,208
9Sep 1, 2026 09:5764,963548,958,676481,467,00057,726,0002,142,208