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 18:04Karthik ReddyKarthik ReddyScore: 3,629Success
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 18:053,5873,038,916,07726,150,0003,629,00020,480
2Oct 2, 2026 18:053,5983,038,791,67026,210,0003,657,00020,480
3Oct 2, 2026 18:053,6063,040,482,27626,194,0003,737,00020,480
4Oct 2, 2026 18:053,6253,039,296,05226,247,0003,844,00020,480
5Oct 2, 2026 18:053,6293,039,175,28026,292,0003,832,00020,480
6Oct 2, 2026 18:053,6363,039,218,32926,241,0003,942,00020,480
7Oct 2, 2026 18:053,6373,039,352,19826,233,0003,960,00020,480
8Oct 2, 2026 18:053,6383,039,298,23826,338,0003,863,00020,480
9Oct 2, 2026 18:053,6503,039,290,74326,200,0004,097,00020,480