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 24, 2026 22:43Victor MerckléVictor MerckléScore: 3,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:443,90340,769,43631,374,0001,023,0002,117,632stderr
2Aug 24, 2026 22:443,90440,779,19731,389,0001,015,0002,117,632stderr
3Aug 24, 2026 22:443,90540,843,55531,367,0001,052,0002,117,632stderr
4Aug 24, 2026 22:443,90540,698,35131,405,0001,012,0002,117,632stderr
5Aug 24, 2026 22:443,90540,802,97431,386,0001,030,0002,117,632stderr
6Aug 24, 2026 22:443,91041,136,65431,353,0001,108,0002,117,632stderr
7Aug 24, 2026 22:443,92240,939,93331,535,0001,020,0002,117,632stderr
8Aug 24, 2026 22:443,92240,849,74631,526,0001,032,0002,117,632stderr
9Aug 24, 2026 22:443,93241,052,20031,524,0001,117,0002,117,632stderr