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 12, 2026 01:06Victor MerckléVictor MerckléScore: 80,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:0780,106673,314,238659,416,0005,464,0002,117,632stderr
2Aug 12, 2026 01:0780,277675,380,085660,748,0005,557,0002,117,632stderr
3Aug 12, 2026 01:0780,606678,146,474663,418,0005,615,0002,117,632stderr
4Aug 12, 2026 01:0780,734678,843,555664,657,0005,438,0002,117,632stderr
5Aug 12, 2026 01:0780,768678,883,600664,501,0005,879,0002,117,632stderr
6Aug 12, 2026 01:0780,921680,881,495666,105,0005,545,0002,117,632stderr
7Aug 12, 2026 01:0780,941680,269,876665,910,0005,905,0002,117,632stderr
8Aug 12, 2026 01:0781,056681,312,993666,818,0005,951,0002,117,632stderr
9Aug 12, 2026 01:0781,058681,288,677666,978,0005,808,0002,117,632stderr