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 listJan 21, 2025 17:12Ian MckibbenIan MckibbenScore: 122,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 17:12119,4631,012,991,154990,548,000999,0002,437,120
2Jan 21, 2025 17:12122,0761,036,373,3581,012,229,000999,0002,531,328
3Jan 21, 2025 17:12123,2691,047,813,1941,023,130,00002,420,736