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 11, 2026 16:05Victor MerckléVictor MerckléScore: 3,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:053,84640,273,70430,856,0001,066,0002,117,632stderr
2Aug 11, 2026 16:053,84640,339,97330,887,0001,035,0002,117,632stderr
3Aug 11, 2026 16:053,84840,296,94430,886,0001,059,0002,117,632stderr
4Aug 11, 2026 16:053,85040,367,28430,918,0001,038,0002,117,632stderr
5Aug 11, 2026 16:053,85740,420,19130,995,0001,024,0002,117,632stderr
6Aug 11, 2026 16:053,85740,424,83730,987,0001,032,0002,117,632stderr
7Aug 11, 2026 16:053,87440,507,25431,109,0001,050,0002,117,632stderr
8Aug 11, 2026 16:053,87740,552,31731,148,0001,037,0002,117,632stderr
9Aug 11, 2026 16:053,88340,636,26731,193,0001,044,0002,117,632stderr