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 listAug 27, 2026 02:19Victor MerckléVictor MerckléScore: 3,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:193,69538,968,07529,501,0001,169,0002,113,536
2Aug 27, 2026 02:193,70039,010,54529,614,0001,102,0002,113,536
3Aug 27, 2026 02:193,70938,997,04229,727,0001,063,0002,113,536
4Aug 27, 2026 02:193,71339,114,93429,724,0001,096,0002,113,536
5Aug 27, 2026 02:193,72139,208,10329,764,0001,125,0002,113,536
6Aug 27, 2026 02:193,75439,430,97030,062,0001,103,0002,113,536
7Aug 27, 2026 02:193,80039,707,17730,448,0001,094,0002,113,536
8Aug 27, 2026 02:193,83040,012,54430,697,0001,100,0002,113,536
9Aug 27, 2026 02:193,93141,613,99731,567,0001,063,0002,113,536