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 16:50Victor MerckléVictor MerckléScore: 3,802Success
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 16:533,77939,693,34930,330,0001,039,0002,113,536
2Aug 27, 2026 16:533,79739,868,33630,319,0001,204,0002,113,536
3Aug 27, 2026 16:533,79940,598,93330,235,0001,298,0002,113,536
4Aug 27, 2026 16:533,80239,898,56930,324,0001,238,0002,113,536
5Aug 27, 2026 16:533,80240,641,76630,282,0001,282,0002,113,536
6Aug 27, 2026 16:533,80339,936,84230,548,0001,017,0002,113,536
7Aug 27, 2026 16:533,80539,916,23230,316,0001,269,0002,113,536
8Aug 27, 2026 16:533,80639,751,92130,558,0001,035,0002,113,536
9Aug 27, 2026 16:533,95741,168,25631,640,0001,210,0002,113,536