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 listNov 30, 2025 11:35Rajarshi BasuRajarshi BasuScore: 13,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 11:3513,834143,433,640113,828,000998,0002,289,664
2Nov 30, 2025 11:3513,837139,544,018112,851,0001,997,0002,281,472
3Nov 30, 2025 11:3513,838143,216,729112,862,0001,997,0002,289,664
4Nov 30, 2025 11:3513,844139,079,171113,903,000999,0002,289,664
5Nov 30, 2025 11:3513,847146,126,368112,930,0001,998,0002,265,088
6Nov 30, 2025 11:3513,847144,483,861112,934,0001,998,0002,281,472
7Nov 30, 2025 11:3513,852140,875,269113,970,000999,0002,273,280
8Nov 30, 2025 11:3513,853145,704,342113,978,000999,0002,289,664
9Nov 30, 2025 11:3513,861139,794,019113,048,0002,000,0002,289,664