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 26, 2026 19:16Victor MerckléVictor MerckléScore: 4,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 19:164,34544,212,55034,995,0001,073,0002,117,632stderr
2Aug 26, 2026 19:164,36744,645,35235,196,0001,053,0002,117,632stderr
3Aug 26, 2026 19:164,37244,600,85635,217,0001,073,0002,117,632stderr
4Aug 26, 2026 19:164,37544,452,17035,201,0001,112,0002,117,632stderr
5Aug 26, 2026 19:164,50545,534,46236,326,0001,069,0002,117,632stderr
6Aug 26, 2026 19:164,51546,525,55736,432,0001,047,0002,117,632stderr
7Aug 26, 2026 19:164,54946,837,93636,709,0001,054,0002,117,632stderr
8Aug 26, 2026 19:164,66746,878,78737,698,0001,041,0002,117,632stderr
9Aug 26, 2026 19:164,86548,563,89739,351,0001,036,0002,117,632stderr