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 07:49Victor MerckléVictor MerckléScore: 75,412Success
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 07:5074,763628,966,734615,289,0005,251,0002,117,632stderr
2Aug 12, 2026 07:5074,779628,911,209615,341,0005,332,0002,117,632stderr
3Aug 12, 2026 07:5074,881630,015,685615,784,0005,729,0002,117,632stderr
4Aug 12, 2026 07:5075,327633,667,985619,637,0005,584,0002,117,632stderr
5Aug 12, 2026 07:5075,412634,380,342620,190,0005,732,0002,117,632stderr
6Aug 12, 2026 07:5075,501636,369,365621,275,0005,389,0002,117,632stderr
7Aug 12, 2026 07:5075,617636,205,114622,160,0005,467,0002,117,632stderr
8Aug 12, 2026 07:5075,630636,220,866622,100,0005,629,0002,117,632stderr
9Aug 12, 2026 07:5075,694636,879,433623,243,0005,020,0002,117,632stderr