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 listMar 15, 2026 14:27eldon-chungeldon-chungScore: 47,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 14:2747,953424,105,794396,011,0002,000,0002,285,568
2Mar 15, 2026 14:2747,964420,570,675396,098,0002,000,0002,285,568
3Mar 15, 2026 14:2747,965424,948,932396,110,0002,000,0002,285,568
4Mar 15, 2026 14:2747,971422,759,997397,163,0001,000,0002,265,088
5Mar 15, 2026 14:2747,977426,320,459397,207,0001,000,0002,285,568
6Mar 15, 2026 14:2747,979422,530,989398,224,00002,285,568
7Mar 15, 2026 14:2747,995433,709,156397,362,0001,000,0002,285,568
8Mar 15, 2026 14:2748,000425,464,928398,399,00002,277,376
9Mar 15, 2026 14:2748,097431,078,258397,207,0001,996,0002,277,376