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 07:08Karthik ReddyKarthik ReddyScore: 3,279Success
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 07:103,26936,158,11927,137,000020,480
2Oct 2, 2026 07:103,27036,159,15227,148,000020,480
3Oct 2, 2026 07:103,27036,240,00627,149,000020,480
4Oct 2, 2026 07:103,27436,391,51426,170,0001,010,00020,480
5Oct 2, 2026 07:103,27936,336,83827,221,000020,480
6Oct 2, 2026 07:103,27936,197,01027,223,000020,480
7Oct 2, 2026 07:103,28636,323,10727,282,000020,480
8Oct 2, 2026 07:103,28836,313,63327,298,000020,480
9Oct 2, 2026 07:103,31636,538,28526,391,0001,134,00020,480