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 1, 2026 08:43Karthik ReddyKarthik ReddyScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:443,40037,249,75827,169,0001,053,0002,113,536
2Oct 1, 2026 08:443,40237,267,60227,176,0001,062,0002,113,536
3Oct 1, 2026 08:443,41137,323,51227,254,0001,065,0002,113,536
4Oct 1, 2026 08:443,41137,353,70727,263,0001,053,0002,113,536
5Oct 1, 2026 08:443,41137,306,26227,267,0001,047,0002,113,536
6Oct 1, 2026 08:443,41737,334,43927,320,0001,044,0002,113,536
7Oct 1, 2026 08:443,41837,319,59527,302,0001,073,0002,113,536
8Oct 1, 2026 08:443,42237,397,55327,353,0001,053,0002,113,536
9Oct 1, 2026 08:443,43537,486,77327,397,0001,120,0002,113,536