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 17, 2026 03:08Andrew EpsteinAndrew EpsteinScore: 50,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:1050,140427,109,974414,113,0002,050,0002,117,632stderr
2Sep 17, 2026 03:1050,208427,065,270414,689,0002,041,0002,121,728stderr
3Sep 17, 2026 03:1050,233428,049,342414,873,0002,065,0002,117,632stderr
4Sep 17, 2026 03:1050,252427,416,530415,047,0002,048,0002,121,728stderr
5Sep 17, 2026 03:1050,254427,445,259415,053,0002,062,0002,121,728stderr
6Sep 17, 2026 03:1050,278428,451,771415,260,0002,054,0002,121,728stderr
7Sep 17, 2026 03:1050,347429,030,327415,783,0002,101,0002,121,728stderr
8Sep 17, 2026 03:1050,354428,986,885415,876,0002,069,0002,121,728stderr
9Sep 17, 2026 03:1050,773432,564,428419,343,0002,081,0002,121,728stderr