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 7, 2026 19:14Sai PutravuSai PutravuScore: 2,067,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:152,065,54217,155,126,34417,079,966,00064,036,00020,480
2Sep 7, 2026 19:152,067,50317,172,000,97517,093,163,00067,119,00020,480
3Sep 7, 2026 19:152,068,34617,178,318,43417,102,241,00065,034,00020,480