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 23, 2026 19:26Victor MerckléVictor MerckléScore: 3,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:273,92040,784,38631,364,0001,176,0002,117,632stderr
2Aug 23, 2026 19:273,92640,998,52331,437,0001,157,0002,117,632stderr
3Aug 23, 2026 19:273,97842,126,88731,850,0001,169,0002,117,632stderr
4Aug 23, 2026 19:273,99141,300,31031,992,0001,134,0002,117,632stderr
5Aug 23, 2026 19:273,99641,568,87732,059,0001,112,0002,117,632stderr
6Aug 23, 2026 19:274,08642,312,52332,899,0001,023,0002,117,632stderr
7Aug 23, 2026 19:274,08642,305,87532,763,0001,154,0002,117,632stderr
8Aug 23, 2026 19:274,11643,324,51433,147,0001,018,0002,117,632stderr
9Aug 23, 2026 19:274,12142,641,50333,105,0001,103,0002,117,632stderr