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 listApr 20, 2025 22:37KeefeKeefeScore: 59,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 22:3758,997515,833,783487,679,0001,998,0002,527,232
2Apr 20, 2025 22:3759,050521,497,437490,118,00002,441,216
3Apr 20, 2025 22:3759,054511,879,393490,152,00002,441,216
4Apr 20, 2025 22:3759,056513,582,795490,163,00002,531,328
5Apr 20, 2025 22:3759,067514,693,862490,252,00002,531,328
6Apr 20, 2025 22:3759,071517,420,789490,290,00002,269,184