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 02:58Karthik ReddyKarthik ReddyScore: 3,405Success
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 02:593,39437,169,65927,121,0001,055,0002,113,536
2Oct 1, 2026 02:593,39737,264,34427,129,0001,070,0002,113,536
3Oct 1, 2026 02:593,40237,248,46027,199,0001,041,0002,113,536
4Oct 1, 2026 02:593,40337,241,88327,194,0001,052,0002,113,536
5Oct 1, 2026 02:593,40537,315,80627,194,0001,072,0002,113,536
6Oct 1, 2026 02:593,40637,285,45427,239,0001,038,0002,113,536
7Oct 1, 2026 02:593,40637,528,79927,215,0001,062,0002,113,536
8Oct 1, 2026 02:593,40837,322,39227,247,0001,045,0002,113,536
9Oct 1, 2026 02:593,41737,359,52727,268,0001,101,0002,113,536