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 21:04Karthik ReddyKarthik ReddyScore: 3,727Success
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 21:053,6993,039,794,46026,348,0004,355,00020,480
2Oct 2, 2026 21:053,7023,039,737,39026,287,0004,440,00020,480
3Oct 2, 2026 21:053,7113,039,955,48326,300,0004,503,00020,480
4Oct 2, 2026 21:053,7143,039,898,75626,351,0004,479,00020,480
5Oct 2, 2026 21:053,7273,039,936,39826,312,0004,624,00020,480
6Oct 2, 2026 21:053,7323,040,054,09426,209,0004,771,00020,480
7Oct 2, 2026 21:053,7383,040,309,11726,338,0004,693,00020,480
8Oct 2, 2026 21:053,7543,040,217,94026,361,0004,801,00020,480
9Oct 2, 2026 21:054,1113,050,826,53029,541,0004,585,00020,480