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 listOct 2, 2026 05:28Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 05:2903,089,040,76878,758,0001,038,00020,480expected "53694279978840311 ", got "53694279978840311 2 2 2993464 26387 56 1|26143 26112 |3072167 "
2Oct 2, 2026 05:2903,089,311,12379,061,0001,007,00020,480expected "53682606893885399 ", got "53682606893885399 2 2 2993458 26507 57 1|26210 26196 |3072432 "
3Oct 2, 2026 05:2903,089,388,37179,191,0001,009,00020,480expected "53684352485102318 ", got "53684352485102318 2 2 2993456 26495 55 1|26322 26236 |3072568 "