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:33Victor MerckléVictor MerckléScore: 3,896Success
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:353,72939,372,57429,904,0001,051,0002,117,632stderr
2Aug 29, 2026 15:353,86041,121,62831,020,0001,026,0002,117,632stderr
3Aug 29, 2026 15:353,87140,458,61831,072,0001,059,0002,117,632stderr
4Aug 29, 2026 15:353,87641,141,35631,155,0001,024,0002,117,632stderr
5Aug 29, 2026 15:353,89640,706,75531,307,0001,031,0002,117,632stderr
6Aug 29, 2026 15:353,90940,909,65231,389,0001,059,0002,117,632stderr
7Aug 29, 2026 15:353,91840,911,14731,493,0001,028,0002,117,632stderr
8Aug 29, 2026 15:353,92040,853,68931,491,0001,052,0002,117,632stderr
9Aug 29, 2026 15:353,98341,400,17832,037,0001,030,0002,117,632stderr