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 1, 2026 23:36TonyTonyScore: 28,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:3627,416235,976,858226,531,0001,030,0002,117,632
2Aug 1, 2026 23:3627,423235,856,692226,497,0001,118,0002,117,632
3Aug 1, 2026 23:3627,439236,204,218226,642,0001,107,0002,117,632
4Aug 1, 2026 23:3627,742238,601,115229,079,0001,180,0002,117,632
5Aug 1, 2026 23:3628,446244,530,814234,986,0001,118,0002,117,632
6Aug 1, 2026 23:3628,453244,413,912235,030,0001,132,0002,117,632
7Aug 1, 2026 23:3628,477244,890,518235,244,0001,118,0002,117,632
8Aug 1, 2026 23:3628,751247,257,553237,451,0001,190,0002,117,632
9Aug 1, 2026 23:3628,784247,178,380237,693,0001,217,0002,117,632