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 listAug 2, 2026 16:02TonyTonyScore: 13,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:0313,035118,035,47279,878,00028,316,0002,113,536
2Aug 2, 2026 16:0313,049118,239,45280,063,00028,250,0002,113,536
3Aug 2, 2026 16:0313,087123,017,40079,959,00028,668,0002,113,536
4Aug 2, 2026 16:0313,102118,602,85280,240,00028,513,0002,113,536
5Aug 2, 2026 16:0313,129118,800,14980,604,00028,369,0002,117,632
6Aug 2, 2026 16:0313,164119,125,95980,483,00028,783,0002,113,536
7Aug 2, 2026 16:0313,193119,367,86180,586,00028,921,0002,113,536
8Aug 2, 2026 16:0313,193119,361,08781,073,00028,433,0002,113,536
9Aug 2, 2026 16:0313,197119,428,08980,731,00028,811,0002,113,536