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 9, 2026 21:12Karthik ReddyKarthik ReddyScore: 3,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:133,2363,035,848,56026,866,000020,480
2Oct 9, 2026 21:133,2513,036,012,15026,989,000020,480
3Oct 9, 2026 21:133,2553,036,099,82127,018,000020,480
4Oct 9, 2026 21:133,2573,035,916,21426,017,0001,023,00020,480
5Oct 9, 2026 21:133,2583,035,975,69826,043,0001,002,00020,480
6Oct 9, 2026 21:133,2603,037,656,65427,060,000020,480
7Oct 9, 2026 21:133,2723,036,268,17427,161,000020,480
8Oct 9, 2026 21:133,2873,036,338,91327,290,000020,480
9Oct 9, 2026 21:133,3403,036,960,21127,728,000020,480