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 29, 2026 15:25Victor MerckléVictor MerckléScore: 4,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 15:264,28743,981,16134,526,0001,063,0002,117,632stderr
2Aug 29, 2026 15:264,45245,288,66535,905,0001,049,0002,117,632stderr
3Aug 29, 2026 15:264,47045,421,76336,061,0001,047,0002,117,632stderr
4Aug 29, 2026 15:264,48146,243,09236,148,0001,051,0002,117,632stderr
5Aug 29, 2026 15:264,48545,615,69136,208,0001,020,0002,117,632stderr
6Aug 29, 2026 15:264,49345,681,00136,244,0001,049,0002,117,632stderr
7Aug 29, 2026 15:264,49846,403,26836,260,0001,078,0002,117,632stderr
8Aug 29, 2026 15:264,50545,722,76136,368,0001,026,0002,117,632stderr
9Aug 29, 2026 15:264,52545,903,99536,499,0001,062,0002,117,632stderr