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 listDec 8, 2025 11:58Jatin GargJatin GargScore: 63,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:5863,448551,372,531523,624,0002,997,0002,523,136
2Dec 8, 2025 11:5863,471550,728,268524,814,0001,999,0002,289,664
3Dec 8, 2025 11:5863,506552,922,078526,099,0001,000,0002,281,472