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 25, 2025 18:04Mikhail ShirokovMikhail ShirokovScore: 71,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 18:0471,402615,104,204590,641,0001,998,0002,437,120
2Jan 25, 2025 18:0471,415616,183,037590,744,0001,999,0002,531,328
3Jan 25, 2025 18:0471,420616,408,803590,788,0001,999,0002,531,328