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 8, 2026 08:12Karthik ReddyKarthik ReddyScore: 4,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2026 08:124,87449,486,72239,341,0001,117,0002,117,632
2Oct 8, 2026 08:124,87749,491,60639,366,0001,118,0002,117,632
3Oct 8, 2026 08:124,88049,544,66939,395,0001,113,0002,117,632
4Oct 8, 2026 08:124,88449,596,06639,407,0001,138,0002,117,632
5Oct 8, 2026 08:124,88449,576,37039,434,0001,107,0002,117,632
6Oct 8, 2026 08:124,88549,578,33239,448,0001,103,0002,117,632
7Oct 8, 2026 08:124,88749,775,26039,430,0001,138,0002,117,632
8Oct 8, 2026 08:124,89049,577,70039,478,0001,113,0002,117,632
9Oct 8, 2026 08:124,90049,731,91139,467,0001,203,0002,117,632