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 listSep 24, 2026 21:03Karthik ReddyKarthik ReddyScore: 26,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 21:0326,253228,635,950216,905,0001,003,0002,113,536
2Sep 24, 2026 21:0326,301228,611,253217,297,0001,003,0002,113,536
3Sep 24, 2026 21:0326,314229,429,101217,411,0001,002,0002,113,536
4Sep 24, 2026 21:0326,334228,844,771217,577,0001,003,0002,113,536
5Sep 24, 2026 21:0326,379229,130,596217,946,0001,003,0002,113,536
6Sep 24, 2026 21:0326,433229,655,343218,395,0001,003,0002,113,536
7Sep 24, 2026 21:0326,442229,754,805218,465,0001,004,0002,113,536
8Sep 24, 2026 21:0326,475230,015,058218,741,0001,004,0002,113,536
9Sep 24, 2026 21:0327,086235,122,803223,815,0001,002,0002,113,536